Submission #6883164
Source Code Expand
n = int(input()) for i in range(1,10**4): if (i*(i-1))//2 < n <= ((i+1)*i)//2: maxn = i break ans_list = [] for i in range(maxn,0,-1): if n >= i: ans_list.append(i) n -= i for i in sorted(ans_list): print(i)
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | ASTR1104 |
Language | PyPy3 (2.4.0) |
Score | 300 |
Code Size | 277 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 41584 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 | 165 ms | 38256 KB |
01-02.txt | AC | 160 ms | 38256 KB |
01-03.txt | AC | 163 ms | 38256 KB |
01-04.txt | AC | 178 ms | 38256 KB |
01-05.txt | AC | 172 ms | 38256 KB |
01-06.txt | AC | 170 ms | 38256 KB |
01-07.txt | AC | 167 ms | 38256 KB |
01-08.txt | AC | 161 ms | 38256 KB |
01-09.txt | AC | 167 ms | 38256 KB |
01-10.txt | AC | 167 ms | 38256 KB |
02-01.txt | AC | 199 ms | 41584 KB |
02-02.txt | AC | 200 ms | 41584 KB |
02-03.txt | AC | 204 ms | 41584 KB |
02-04.txt | AC | 201 ms | 41584 KB |
02-05.txt | AC | 202 ms | 41584 KB |
02-06.txt | AC | 199 ms | 41584 KB |
02-07.txt | AC | 199 ms | 41584 KB |
02-08.txt | AC | 200 ms | 41584 KB |
sample-01.txt | AC | 161 ms | 38256 KB |
sample-02.txt | AC | 169 ms | 38256 KB |
sample-03.txt | AC | 164 ms | 38256 KB |