[Haskell-cafe] How to dynamic plan in Haskell?

Magicloud Magiclouds magicloud.magiclouds at gmail.com
Sat May 18 04:33:00 UTC 2019


I solved the question. But I could not figure out a FP style solution.


1 - 9, nine numbers. Show all the possible combinations that sum up to
10. Different orders are counted as the same.

For example, [1, 4, 5].

More information about the Haskell-Cafe mailing list