Submission #991981


Source Code Expand

from sys import exit, setrecursionlimit
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

setrecursionlimit(1000000)

N = read()

if 1 <= N <= 2:
  print(N); exit()

for k in range(N):
  if (k-1)*k < N*2 <= k*(k+1):
    break

while N > 0 and k > 0:
  if k <= N:
    N -= k; print(k)
  k -= 1

Submission Info

Submission Time
Task B - Exactly N points
User ukikagi
Language Python (3.4.3)
Score 300
Code Size 478 Byte
Status AC
Exec Time 323 ms
Memory 4068 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 21
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
Case Name Status Exec Time Memory
01-01.txt AC 323 ms 3828 KB
01-02.txt AC 27 ms 3700 KB
01-03.txt AC 27 ms 3700 KB
01-04.txt AC 27 ms 3700 KB
01-05.txt AC 27 ms 3700 KB
01-06.txt AC 27 ms 3700 KB
01-07.txt AC 28 ms 3700 KB
01-08.txt AC 27 ms 3700 KB
01-09.txt AC 28 ms 3700 KB
01-10.txt AC 27 ms 3700 KB
02-01.txt AC 32 ms 3940 KB
02-02.txt AC 33 ms 3940 KB
02-03.txt AC 33 ms 3940 KB
02-04.txt AC 33 ms 3940 KB
02-05.txt AC 33 ms 4068 KB
02-06.txt AC 30 ms 3940 KB
02-07.txt AC 29 ms 3940 KB
02-08.txt AC 33 ms 3940 KB
sample-01.txt AC 28 ms 3700 KB
sample-02.txt AC 27 ms 3700 KB
sample-03.txt AC 27 ms 3700 KB