RosettaCodeData/Task/Combinations/Haskell/combinations-5.hs

3 lines
104 B
Haskell

import Data.List (sort, subsequences)
comb m n = sort . filter ((==m) . length) $ subsequences [0..n-1]