Submission #5420792

Source Code Expand

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 Python (3.4.3)
Score 0
Code Size 187 Byte
Status RE
Exec Time 2104 ms
Memory 3444 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 10
RE × 3
AC × 15
TLE × 6
RE × 3
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 RE 17 ms 3060 KB
01-02.txt AC 16 ms 2940 KB
01-03.txt RE 17 ms 2940 KB
01-04.txt AC 17 ms 2940 KB
01-05.txt AC 17 ms 2940 KB
01-06.txt AC 17 ms 2940 KB
01-07.txt AC 17 ms 2940 KB
01-08.txt RE 17 ms 3060 KB
01-09.txt AC 17 ms 2940 KB
01-10.txt AC 17 ms 2940 KB
02-01.txt TLE 2104 ms 3060 KB
02-02.txt TLE 2104 ms 3060 KB
02-03.txt TLE 2103 ms 3060 KB
02-04.txt TLE 2103 ms 3060 KB
02-05.txt TLE 2103 ms 3060 KB
02-06.txt AC 673 ms 3444 KB
02-07.txt AC 315 ms 3316 KB
02-08.txt TLE 2103 ms 3060 KB
sample-01.txt AC 17 ms 2940 KB
sample-02.txt AC 17 ms 2940 KB
sample-03.txt AC 17 ms 2940 KB