Submission #1520789
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 : (ms1 ++ ms2)) where ps = last$ takeWhile (<= 1000000000) $ scanl1 (*) primes ms1 = [div x p | p<- take 49 primes, let x = until (>1000000000) (*p) 2] ms2 = [div x p | p<- take 50 primes, let x = until (>1000000000) (*p) p]
Submission Info
Submission Time | |
---|---|
Task | A - 約数をたくさんつくろう! |
User | aimy |
Language | Haskell (GHC 7.10.3) |
Score | 992 |
Code Size | 486 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 508 KB |
Judge Result
Set Name | test_01 | ||
---|---|---|---|
Score / Max Score | 992 / 100000 | ||
Status |
|
Set Name | Test Cases |
---|---|
test_01 | noinput.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
noinput.txt | AC | 2 ms | 508 KB |