Partition an integer x into n primes: Difference between revisions
m
→{{header|Haskell}}: (minor reductions – fractionally faster)
m (→{{header|Haskell}}: Specified one import) |
m (→{{header|Haskell}}: (minor reductions – fractionally faster)) |
||
Line 624:
[ x
| x `elem` ps_ ]
go ps_ x n = ((flip bool [] . head) <*> null) (foldMap found ps_)
where
-------------------------- TEST ---------------------------
| |||