Submission #3414470
Source Code Expand
N, K = map(int, input().split()) D = set(map(int, input().split())) for i in range(N, N * 10): j = i while j: q = j % 10 j //= 10 if q in D: break else: print(i) break
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | poina |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 242 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 2940 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_X_01.txt, subtask1_X_02.txt, subtask1_X_03.txt, subtask1_X_04.txt, subtask1_X_05.txt, subtask1_X_06.txt, subtask1_X_07.txt, subtask1_X_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 17 ms | 2940 KB |
subtask0_sample_02.txt | AC | 17 ms | 2940 KB |
subtask1_X_01.txt | AC | 20 ms | 2940 KB |
subtask1_X_02.txt | AC | 41 ms | 2940 KB |
subtask1_X_03.txt | AC | 19 ms | 2940 KB |
subtask1_X_04.txt | AC | 16 ms | 2940 KB |
subtask1_X_05.txt | AC | 17 ms | 2940 KB |
subtask1_X_06.txt | AC | 20 ms | 2940 KB |
subtask1_X_07.txt | AC | 17 ms | 2940 KB |
subtask1_X_08.txt | AC | 17 ms | 2940 KB |