Submission #3217777
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 | B - Exactly N points |
User | Gash788 |
Language | Haskell (GHC 7.10.3) |
Score | 300 |
Code Size | 255 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 1148 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, sample-02.txt, sample-03.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, sample-03.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, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 380 KB |
01-02.txt | AC | 1 ms | 508 KB |
01-03.txt | AC | 1 ms | 508 KB |
01-04.txt | AC | 1 ms | 508 KB |
01-05.txt | AC | 1 ms | 508 KB |
01-06.txt | AC | 1 ms | 508 KB |
01-07.txt | AC | 1 ms | 508 KB |
01-08.txt | AC | 1 ms | 508 KB |
01-09.txt | AC | 1 ms | 508 KB |
01-10.txt | AC | 1 ms | 508 KB |
02-01.txt | AC | 20 ms | 1148 KB |
02-02.txt | AC | 17 ms | 1148 KB |
02-03.txt | AC | 17 ms | 1148 KB |
02-04.txt | AC | 16 ms | 1148 KB |
02-05.txt | AC | 16 ms | 1148 KB |
02-06.txt | AC | 6 ms | 1020 KB |
02-07.txt | AC | 4 ms | 1020 KB |
02-08.txt | AC | 15 ms | 1148 KB |
sample-01.txt | AC | 1 ms | 508 KB |
sample-02.txt | AC | 1 ms | 508 KB |
sample-03.txt | AC | 1 ms | 380 KB |