Submission #5430190


Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  N=II()

  i=1
  l=[i]
  sm=i
  while True:
    if sm==N:
      break
    elif sm>N:
      l.remove(sm-N)
      break
    else:
      i+=1
      l.append(i)
      sm+=i

  for x in l:
    print(x)

main()
# print(main())

Submission Info

Submission Time
Task B - Exactly N points
User Kenkoro
Language Python (3.4.3)
Score 300
Code Size 546 Byte
Status AC
Exec Time 44 ms
Memory 5932 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 40 ms 5412 KB
01-02.txt AC 40 ms 5420 KB
01-03.txt AC 40 ms 5416 KB
01-04.txt AC 40 ms 5416 KB
01-05.txt AC 40 ms 5416 KB
01-06.txt AC 40 ms 5416 KB
01-07.txt AC 40 ms 5416 KB
01-08.txt AC 40 ms 5416 KB
01-09.txt AC 40 ms 5416 KB
01-10.txt AC 40 ms 5416 KB
02-01.txt AC 44 ms 5928 KB
02-02.txt AC 43 ms 5932 KB
02-03.txt AC 44 ms 5924 KB
02-04.txt AC 43 ms 5924 KB
02-05.txt AC 44 ms 5928 KB
02-06.txt AC 42 ms 5924 KB
02-07.txt AC 41 ms 5796 KB
02-08.txt AC 43 ms 5924 KB
sample-01.txt AC 42 ms 5412 KB
sample-02.txt AC 41 ms 5540 KB
sample-03.txt AC 41 ms 5420 KB