fork download
  1. {-# OPTIONS_GHC -O2 -fno-cse #-}
  2. primesTME = 2 : gaps 3 (joinT [[p*p, p*p+2*p..] | p <- primes'])
  3. where
  4. primes' = 3 : gaps 5 (joinT -- [[p*p, p*p+2*p..] | p <- primes'])
  5. [map (p*) $ scanl (+) p (cycle[2]) | p <- primes'])
  6.  
  7. joinT ((x:xs):t) = x : union xs (joinT (pairs t))
  8. pairs ((x:xs):ys:t) = (x : union xs ys) : pairs t
  9. gaps k s@(x:xs) | k<x = k:gaps (k+2) s -- equivalent to
  10. | True = gaps (k+2) xs -- [k,k+2..]`minus`s, k<=head s
  11.  
  12. main = mapM_ print
  13. . take 10 . map fst
  14. . tail . iterate (splitAt 10.snd)
  15. $ ([],take 100 primesTME)
  16.  
  17. union (x:xs) (y:ys) = case (compare x y) of
  18. LT -> x : union xs (y:ys)
  19. EQ -> x : union xs ys
  20. GT -> y : union (x:xs) ys
Success #stdin #stdout 0s 5740KB
stdin
Standard input is empty
stdout
[2,3,5,7,11,13,17,19,23,29]
[31,37,41,43,47,53,59,61,67,71]
[73,79,83,89,97,101,103,107,109,113]
[127,131,137,139,149,151,157,163,167,173]
[179,181,191,193,197,199,211,223,227,229]
[233,239,241,251,257,263,269,271,277,281]
[283,293,307,311,313,317,331,337,347,349]
[353,359,367,373,379,383,389,397,401,409]
[419,421,431,433,439,443,449,457,461,463]
[467,479,487,491,499,503,509,521,523,541]