Submission #3927092


Source Code Expand

N = int(input())
L = []

ctr = 1
tmp = 0
for i in range(N) :
    if tmp == ctr :
        ctr += 1
        tmp = 1
    else :
        tmp += 1
    L.append(ctr)
ma = L[-1]

ans = [ma]
pa = 1
while sum(ans) != N :
    if (ans[-1]-pa + sum(ans)) <= N :
        ans.append(ans[-1]-pa)
        pa = 1
    else :
        pa += 1
ans = sorted(ans)
for i in ans :
    print(i)

Submission Info

Submission Time
Task B - Exactly N points
User kawacchu
Language Python (3.4.3)
Score 200
Code Size 394 Byte
Status TLE
Exec Time 2108 ms
Memory 82456 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
AC × 13
AC × 18
TLE × 6
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 17 ms 3060 KB
01-02.txt AC 17 ms 3064 KB
01-03.txt AC 17 ms 3060 KB
01-04.txt AC 17 ms 3060 KB
01-05.txt AC 17 ms 3064 KB
01-06.txt AC 18 ms 3064 KB
01-07.txt AC 18 ms 3064 KB
01-08.txt AC 17 ms 3064 KB
01-09.txt AC 18 ms 3064 KB
01-10.txt AC 17 ms 3064 KB
02-01.txt TLE 2108 ms 81800 KB
02-02.txt TLE 2108 ms 81304 KB
02-03.txt TLE 2108 ms 82456 KB
02-04.txt TLE 2108 ms 80920 KB
02-05.txt TLE 2108 ms 81560 KB
02-06.txt AC 678 ms 25368 KB
02-07.txt AC 312 ms 13592 KB
02-08.txt TLE 2108 ms 77208 KB
sample-01.txt AC 17 ms 3064 KB
sample-02.txt AC 17 ms 3060 KB
sample-03.txt AC 17 ms 3064 KB