Submission #11610312
Source Code Expand
from math import sqrt
n=int(input())
d=min(-(-int(sqrt(8*n+1))//2),n)
l=list(range(1,d+1))
remain=(d*(d+1))//2-n
while remain<=l[-1]:
remain-=l[-1]
l.pop()
print(set(l)-set([remain]))
Submission Info
| Submission Time | |
|---|---|
| Task | B - Exactly N points |
| User | arahi10 |
| Language | Python (3.4.3) |
| Score | 0 |
| Code Size | 199 Byte |
| Status | RE |
| Exec Time | 19 ms |
| Memory | 3188 KB |
Judge Result
| Set Name | sample | dataset1 | dataset2 | ||||||
|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 200 | 0 / 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 | RE | 17 ms | 3060 KB |
| 01-02.txt | RE | 17 ms | 3060 KB |
| 01-03.txt | RE | 17 ms | 3060 KB |
| 01-04.txt | RE | 17 ms | 2940 KB |
| 01-05.txt | RE | 17 ms | 3060 KB |
| 01-06.txt | RE | 17 ms | 2940 KB |
| 01-07.txt | RE | 17 ms | 3060 KB |
| 01-08.txt | RE | 17 ms | 2940 KB |
| 01-09.txt | RE | 17 ms | 3060 KB |
| 01-10.txt | RE | 18 ms | 3060 KB |
| 02-01.txt | RE | 19 ms | 3188 KB |
| 02-02.txt | RE | 19 ms | 3188 KB |
| 02-03.txt | RE | 18 ms | 3188 KB |
| 02-04.txt | RE | 19 ms | 3188 KB |
| 02-05.txt | RE | 18 ms | 3188 KB |
| 02-06.txt | RE | 18 ms | 3060 KB |
| 02-07.txt | RE | 18 ms | 3064 KB |
| 02-08.txt | RE | 18 ms | 3188 KB |
| sample-01.txt | RE | 17 ms | 3060 KB |
| sample-02.txt | RE | 17 ms | 3060 KB |
| sample-03.txt | RE | 17 ms | 2940 KB |