Submission #1520784


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 (ps : ms)
  where
    ps = last$ takeWhile (<= 1000000000) $ scanl1 (*) primes
    ms = [div x p | p<- take 99 primes, let x = until (>1000000000) (*p) 2]

Submission Info

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

Judge Result

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