Submission #1520806


Source Code Expand

primes :: Integral a => [a]
primes = 2 : 3 : [x | i <- [1 ..], j <- [-1, 1], let x = 6 * i + j, isPrime x]
  where
    isPrime n = null [i | i <- takeWhile (\p -> p * p <= n) primes, mod n i == 0]

main = putStrLn $ unlines $ map show $ take 100 [x | i<-[1..], let x = until (<=1000000000) (`div` 2) $ until (>1000000000) (*3) (2*i)]

Submission Info

Submission Time
Task A - 約数をたくさんつくろう!
User aimy
Language Haskell (GHC 7.10.3)
Score 918
Code Size 338 Byte
Status AC
Exec Time 2 ms
Memory 508 KB

Judge Result

Set Name test_01
Score / Max Score 918 / 100000
Status
AC × 1
Set Name Test Cases
test_01 noinput.txt
Case Name Status Exec Time Memory
noinput.txt AC 2 ms 508 KB