Submission #11180407
Source Code Expand
n = int(input()) A = [] while(n != 0): if n % 2 == 0: A.append(n//2 + 1) n = n - (n // 2 + 1) else: A.append((n + 1) // 2) n = n - (n + 1) // 2 A = sorted(A) for i in A: print(i)
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | y16a |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 235 Byte |
Status | WA |
Exec Time | 166 ms |
Memory | 38384 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 | 166 ms | 38384 KB |
01-02.txt | AC | 160 ms | 38256 KB |
01-03.txt | AC | 159 ms | 38256 KB |
01-04.txt | WA | 158 ms | 38256 KB |
01-05.txt | WA | 159 ms | 38256 KB |
01-06.txt | WA | 159 ms | 38384 KB |
01-07.txt | WA | 159 ms | 38256 KB |
01-08.txt | WA | 161 ms | 38256 KB |
01-09.txt | WA | 159 ms | 38256 KB |
01-10.txt | WA | 159 ms | 38256 KB |
02-01.txt | WA | 160 ms | 38256 KB |
02-02.txt | WA | 159 ms | 38256 KB |
02-03.txt | WA | 162 ms | 38256 KB |
02-04.txt | WA | 160 ms | 38256 KB |
02-05.txt | WA | 159 ms | 38256 KB |
02-06.txt | WA | 162 ms | 38256 KB |
02-07.txt | WA | 159 ms | 38256 KB |
02-08.txt | WA | 158 ms | 38256 KB |
sample-01.txt | AC | 160 ms | 38256 KB |
sample-02.txt | AC | 160 ms | 38256 KB |
sample-03.txt | AC | 158 ms | 38256 KB |