Submission #1454963
Source Code Expand
import math N = int(input()) sum =0 for i in range(1,N): sum += i if sum>=N: break for j in range(1,i+1): if j == sum-N: continue print(j)
Submission Info
Submission Time | |
---|---|
Task | B - Exactly N points |
User | mban |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 191 Byte |
Status | RE |
Exec Time | 225 ms |
Memory | 43376 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 | WA | 160 ms | 38384 KB |
01-02.txt | AC | 161 ms | 38256 KB |
01-03.txt | AC | 165 ms | 38256 KB |
01-04.txt | AC | 161 ms | 38256 KB |
01-05.txt | AC | 163 ms | 38256 KB |
01-06.txt | AC | 174 ms | 38256 KB |
01-07.txt | AC | 161 ms | 38256 KB |
01-08.txt | AC | 164 ms | 38256 KB |
01-09.txt | AC | 162 ms | 38256 KB |
01-10.txt | AC | 163 ms | 38256 KB |
02-01.txt | AC | 225 ms | 43376 KB |
02-02.txt | AC | 196 ms | 41584 KB |
02-03.txt | AC | 195 ms | 41584 KB |
02-04.txt | AC | 195 ms | 41584 KB |
02-05.txt | AC | 195 ms | 41584 KB |
02-06.txt | AC | 202 ms | 42456 KB |
02-07.txt | AC | 205 ms | 42344 KB |
02-08.txt | AC | 195 ms | 41584 KB |
sample-01.txt | AC | 161 ms | 38256 KB |
sample-02.txt | AC | 166 ms | 38256 KB |
sample-03.txt | RE | 166 ms | 38640 KB |