Summarize primes: Difference between revisions

m
→‎{{header|Haskell}}: Reduced a little, pruned an import.
m (→‎{{header|Haskell}}: Added a draft in Haskell)
m (→‎{{header|Haskell}}: Reduced a little, pruned an import.)
Line 71:
 
=={{header|Haskell}}==
<lang haskell>import ControlData.MonadList (joinmapAccumL)
import Data.List (mapAccumL)
import Data.Numbers.Primes (isPrime, primes)
 
Line 81 ⟶ 80:
let ps = primes
in filter (\(_, _, n) -> isPrime n) $
zip3snd $
[1 ..]mapAccumL
(\n a (i, p) -> joinlet m = p + a in (m,) (ni, +p, am)))
ps
( snd $0
$ zip mapAccumL[1 ..] ps
(\n a -> join (,) (n + a))
0
ps
)
 
 
--------------------------- TEST -------------------------
9,659

edits