Submission #5421006
Source Code Expand
def f(n): return int((2*n+0.25)**0.5-0.6)+1 n=int(input()) Ans=[] while n>1: Ans.append(f(n)) n-=f(n) if n>=1: Ans.append(1) print(*Ans,sep="\n")
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | takakin |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 162 Byte |
Status | WA |
Exec Time | 26 ms |
Memory | 3700 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 | AC | 17 ms | 2940 KB |
01-02.txt | AC | 17 ms | 3060 KB |
01-03.txt | AC | 17 ms | 2940 KB |
01-04.txt | AC | 17 ms | 3188 KB |
01-05.txt | AC | 17 ms | 3060 KB |
01-06.txt | WA | 17 ms | 3060 KB |
01-07.txt | AC | 17 ms | 2940 KB |
01-08.txt | AC | 17 ms | 2940 KB |
01-09.txt | WA | 17 ms | 2940 KB |
01-10.txt | WA | 17 ms | 2940 KB |
02-01.txt | AC | 26 ms | 3572 KB |
02-02.txt | AC | 26 ms | 3572 KB |
02-03.txt | WA | 26 ms | 3700 KB |
02-04.txt | WA | 26 ms | 3572 KB |
02-05.txt | WA | 25 ms | 3572 KB |
02-06.txt | WA | 22 ms | 3444 KB |
02-07.txt | WA | 20 ms | 3316 KB |
02-08.txt | WA | 25 ms | 3572 KB |
sample-01.txt | AC | 17 ms | 2940 KB |
sample-02.txt | AC | 17 ms | 2940 KB |
sample-03.txt | AC | 17 ms | 2940 KB |