Hello Wanas, Friday, September 10, 2010, 12:55:14 AM, you wrote: > a) I want to write a function that generates lists of lists of > size $n$. All having the property that sum lst = sum [1..n]. > a-1) After that, I want to remove all permutations. My idea of
you have very interesting questions. hopefully it was already answered at http://www.haskell.org/haskellwiki/Homework_help -- Best regards, Bulat mailto:bulat.zigans...@gmail.com _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
