Submission #417701
Source Code Expand
N = int(input())
res = []
for i in range(N):
if i + sum(list(map(int, str(i)))) == N:
res.append(i)
print(len(res))
for r in res:
print(r)
Submission Info
| Submission Time | |
|---|---|
| Task | B - 方程式 |
| User | yumechi |
| Language | Python (3.2.3) |
| Score | 20 |
| Code Size | 161 Byte |
| Status | TLE |
| Exec Time | 2045 ms |
| Memory | 8896 KB |
Judge Result
| Set Name | Sample | Subtask1 | Subtask2 | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 20 / 20 | 0 / 80 | ||||||||
| Status |
|
|
|
| Set Name | Test Cases |
|---|---|
| Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
| Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt |
| Subtask2 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| subtask0_sample_01.txt | AC | 245 ms | 8628 KB |
| subtask0_sample_02.txt | AC | 131 ms | 8672 KB |
| subtask0_sample_03.txt | AC | 131 ms | 8628 KB |
| subtask1_01.txt | AC | 131 ms | 8660 KB |
| subtask1_02.txt | AC | 132 ms | 8560 KB |
| subtask1_03.txt | AC | 135 ms | 8556 KB |
| subtask1_04.txt | AC | 135 ms | 8556 KB |
| subtask1_05.txt | AC | 131 ms | 8564 KB |
| subtask1_06.txt | AC | 136 ms | 8556 KB |
| subtask1_07.txt | AC | 139 ms | 8556 KB |
| subtask1_08.txt | AC | 138 ms | 8580 KB |
| subtask1_09.txt | AC | 142 ms | 8640 KB |
| subtask1_10.txt | AC | 140 ms | 8684 KB |
| subtask1_11.txt | AC | 140 ms | 8580 KB |
| subtask1_12.txt | AC | 142 ms | 8628 KB |
| subtask1_13.txt | AC | 140 ms | 8560 KB |
| subtask1_14.txt | AC | 136 ms | 8560 KB |
| subtask1_15.txt | AC | 138 ms | 8752 KB |
| subtask2_16.txt | TLE | 2039 ms | 8792 KB |
| subtask2_17.txt | TLE | 2038 ms | 8796 KB |
| subtask2_18.txt | TLE | 2038 ms | 8800 KB |
| subtask2_19.txt | TLE | 2043 ms | 8800 KB |
| subtask2_20.txt | TLE | 2040 ms | 8876 KB |
| subtask2_21.txt | TLE | 2040 ms | 8856 KB |
| subtask2_22.txt | TLE | 2038 ms | 8896 KB |
| subtask2_23.txt | TLE | 2039 ms | 8880 KB |
| subtask2_24.txt | TLE | 2045 ms | 8824 KB |
| subtask2_25.txt | TLE | 2039 ms | 8788 KB |
| subtask2_26.txt | TLE | 2038 ms | 8804 KB |
| subtask2_27.txt | TLE | 2038 ms | 8804 KB |
| subtask2_28.txt | TLE | 2039 ms | 8804 KB |
| subtask2_29.txt | TLE | 2045 ms | 8792 KB |
| subtask2_30.txt | TLE | 2039 ms | 8800 KB |