Submission #5420792


Source Code Expand

Copy
def f(n):
  for i in range(n):
    if i*(i+1)>=2*n:
      return(i)
      break
n=int(input())
Ans=[]
while n>1:
  Ans.append(f(n))
  n-=f(n)
Ans.append(1)
print(*Ans,sep="\n")

Submission Info

Submission Time
Task B - Exactly N points
User takakin
Language Python3 (3.4.3)
Score 0
Code Size 187 Byte
Status
Exec Time 2104 ms
Memory 3444 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt
dataset1 0 / 200 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 0 / 100 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 17 ms 3060 KB
01-02.txt 16 ms 2940 KB
01-03.txt 17 ms 2940 KB
01-04.txt 17 ms 2940 KB
01-05.txt 17 ms 2940 KB
01-06.txt 17 ms 2940 KB
01-07.txt 17 ms 2940 KB
01-08.txt 17 ms 3060 KB
01-09.txt 17 ms 2940 KB
01-10.txt 17 ms 2940 KB
02-01.txt 2104 ms 3060 KB
02-02.txt 2104 ms 3060 KB
02-03.txt 2103 ms 3060 KB
02-04.txt 2103 ms 3060 KB
02-05.txt 2103 ms 3060 KB
02-06.txt 673 ms 3444 KB
02-07.txt 315 ms 3316 KB
02-08.txt 2103 ms 3060 KB
sample-01.txt 17 ms 2940 KB
sample-02.txt 17 ms 2940 KB
sample-03.txt 17 ms 2940 KB