Submission #1680069
Source Code Expand
import sys def calc(n): i = 1 sm = 0 st = set() if n <= 2: st.add(n) return st while sm < n: st.add(i) sm += i i += 1 st = st - calc(sm - n) return st sys.setrecursionlimit(10000000) n = int(input()) c = calc(n) for cc in c: print(cc)
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | oster |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 336 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 3788 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
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 | 18 ms | 3060 KB |
01-02.txt | AC | 18 ms | 3060 KB |
01-03.txt | AC | 18 ms | 3060 KB |
01-04.txt | AC | 18 ms | 3060 KB |
01-05.txt | AC | 18 ms | 3060 KB |
01-06.txt | AC | 18 ms | 3064 KB |
01-07.txt | AC | 18 ms | 3060 KB |
01-08.txt | AC | 18 ms | 2940 KB |
01-09.txt | AC | 18 ms | 3060 KB |
01-10.txt | AC | 18 ms | 3060 KB |
02-01.txt | AC | 22 ms | 3696 KB |
02-02.txt | AC | 22 ms | 3696 KB |
02-03.txt | AC | 22 ms | 3696 KB |
02-04.txt | AC | 22 ms | 3788 KB |
02-05.txt | AC | 22 ms | 3696 KB |
02-06.txt | AC | 20 ms | 3568 KB |
02-07.txt | AC | 19 ms | 3440 KB |
02-08.txt | AC | 22 ms | 3696 KB |
sample-01.txt | AC | 18 ms | 3064 KB |
sample-02.txt | AC | 18 ms | 3064 KB |
sample-03.txt | AC | 18 ms | 2936 KB |