Submission #11341566
Source Code Expand
import sys INF = 10 ** 11 MOD = 10 ** 9 + 7 from collections import deque sys.setrecursionlimit(100000000) from heapq import heapify,heappush,heappop def main(): n = int(input()) ans = [] for i in range(1,9 * len(str(n)) + 1): if n - i >= 0: k = str(n - i) key = 0 for j in range(len(k)): key += int(k[j]) if key == i: ans.append(int(k)) l = len(ans) print(l) for i in range(l): print(ans[l - i - 1]) if __name__=='__main__': main()
Submission Info
Submission Time | |
---|---|
Task | B - 方程式 |
User | hedwig |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 603 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3316 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 80 / 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 | 21 ms | 3316 KB |
subtask0_sample_02.txt | AC | 21 ms | 3316 KB |
subtask0_sample_03.txt | AC | 21 ms | 3316 KB |
subtask1_01.txt | AC | 21 ms | 3316 KB |
subtask1_02.txt | AC | 20 ms | 3316 KB |
subtask1_03.txt | AC | 21 ms | 3316 KB |
subtask1_04.txt | AC | 21 ms | 3316 KB |
subtask1_05.txt | AC | 21 ms | 3316 KB |
subtask1_06.txt | AC | 21 ms | 3316 KB |
subtask1_07.txt | AC | 21 ms | 3316 KB |
subtask1_08.txt | AC | 21 ms | 3316 KB |
subtask1_09.txt | AC | 20 ms | 3316 KB |
subtask1_10.txt | AC | 21 ms | 3316 KB |
subtask1_11.txt | AC | 20 ms | 3316 KB |
subtask1_12.txt | AC | 21 ms | 3316 KB |
subtask1_13.txt | AC | 21 ms | 3316 KB |
subtask1_14.txt | AC | 21 ms | 3316 KB |
subtask1_15.txt | AC | 21 ms | 3316 KB |
subtask2_16.txt | AC | 21 ms | 3316 KB |
subtask2_17.txt | AC | 21 ms | 3316 KB |
subtask2_18.txt | AC | 21 ms | 3316 KB |
subtask2_19.txt | AC | 21 ms | 3316 KB |
subtask2_20.txt | AC | 21 ms | 3316 KB |
subtask2_21.txt | AC | 21 ms | 3316 KB |
subtask2_22.txt | AC | 21 ms | 3316 KB |
subtask2_23.txt | AC | 21 ms | 3316 KB |
subtask2_24.txt | AC | 21 ms | 3316 KB |
subtask2_25.txt | AC | 21 ms | 3316 KB |
subtask2_26.txt | AC | 21 ms | 3316 KB |
subtask2_27.txt | AC | 21 ms | 3316 KB |
subtask2_28.txt | AC | 21 ms | 3316 KB |
subtask2_29.txt | AC | 21 ms | 3316 KB |
subtask2_30.txt | AC | 21 ms | 3316 KB |