Submission #1482285


Source Code Expand

import Data.List
import Control.Arrow

main = readLn >>= mapM_ print . enp

enp n = delete (d-n) [1 .. i]
  where
   as = scanl1 (+) [1..n]
   d = head (dropWhile (<n) as)
   i = maybe undefined succ (elemIndex d as)

Submission Info

Submission Time
Task B - Exactly N points
User aimy
Language Haskell (GHC 7.10.3)
Score 300
Code Size 225 Byte
Status AC
Exec Time 4 ms
Memory 1148 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
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 508 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 4 ms 1148 KB
02-02.txt AC 4 ms 1148 KB
02-03.txt AC 4 ms 1020 KB
02-04.txt AC 4 ms 1148 KB
02-05.txt AC 4 ms 1020 KB
02-06.txt AC 2 ms 1020 KB
02-07.txt AC 2 ms 1020 KB
02-08.txt AC 4 ms 1020 KB
sample-01.txt AC 1 ms 508 KB
sample-02.txt AC 1 ms 508 KB
sample-03.txt AC 1 ms 508 KB