Submission #3908166
Source Code Expand
from math import sqrt, ceil n = int(input()) k = ceil(sqrt(2 * n + 0.25) - 0.5) d = (k * (k + 1) // 2) - n for i in range(1, k+1): if i == d: continue print(i)
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | qLethon |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 188 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3408 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 | 2940 KB |
01-02.txt | AC | 18 ms | 2940 KB |
01-03.txt | AC | 18 ms | 2940 KB |
01-04.txt | AC | 18 ms | 2940 KB |
01-05.txt | AC | 18 ms | 2940 KB |
01-06.txt | AC | 18 ms | 3060 KB |
01-07.txt | AC | 18 ms | 2940 KB |
01-08.txt | AC | 18 ms | 2940 KB |
01-09.txt | AC | 18 ms | 2940 KB |
01-10.txt | AC | 18 ms | 2940 KB |
02-01.txt | AC | 21 ms | 3408 KB |
02-02.txt | AC | 21 ms | 3408 KB |
02-03.txt | AC | 21 ms | 3408 KB |
02-04.txt | AC | 21 ms | 3408 KB |
02-05.txt | AC | 21 ms | 3408 KB |
02-06.txt | AC | 20 ms | 3316 KB |
02-07.txt | AC | 19 ms | 3316 KB |
02-08.txt | AC | 21 ms | 3408 KB |
sample-01.txt | AC | 18 ms | 2940 KB |
sample-02.txt | AC | 17 ms | 2940 KB |
sample-03.txt | AC | 18 ms | 2940 KB |