Submission #3217773

Source Code Expand

main :: IO ()
main = do
    n <- readLn
    mapM_ print $ solve n

solve :: Int -> [Int]
solve n = filter (\i -> sum [1 .. highest n] - i /= n) [1 .. highest n]

highest :: Int -> Int
highest n = head [ i | i <- [1 ..], i * (i + 1) `div` 2 >= n ]

Submission Info

Submission Time
Task C - Interpretation
User Gash788
Language Haskell (GHC 7.10.3)
Score 0
Code Size 255 Byte
Status RE
Exec Time 1 ms
Memory 508 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 200
Status
RE × 2
RE × 12
RE × 27
Set Name Test Cases
sample sample-01.txt, sample-02.txt
dataset1 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt RE 1 ms 508 KB
01-02.txt RE 1 ms 508 KB
01-03.txt RE 1 ms 508 KB
01-04.txt RE 1 ms 508 KB
01-05.txt RE 1 ms 508 KB
01-06.txt RE 1 ms 508 KB
01-07.txt RE 1 ms 508 KB
01-08.txt RE 1 ms 508 KB
01-09.txt RE 1 ms 508 KB
01-10.txt RE 1 ms 508 KB
02-01.txt RE 1 ms 508 KB
02-02.txt RE 1 ms 508 KB
02-03.txt RE 1 ms 508 KB
02-04.txt RE 1 ms 508 KB
02-05.txt RE 1 ms 508 KB
02-06.txt RE 1 ms 508 KB
02-07.txt RE 1 ms 508 KB
02-08.txt RE 1 ms 508 KB
02-09.txt RE 1 ms 508 KB
02-10.txt RE 1 ms 508 KB
02-11.txt RE 1 ms 508 KB
02-12.txt RE 1 ms 508 KB
02-13.txt RE 1 ms 508 KB
sample-01.txt RE 1 ms 508 KB
sample-02.txt RE 1 ms 508 KB