Submission #4644907


Source Code Expand

n, k = map(int,input().split())
d = list(map(int,input().split()))

for i in range(n,10*n):
    ans = str(i)
    for j in range(len(ans)):
        if int(ans[j]) in d:
            break

        if j == len(ans) - 1:
            print(i)
            exit()

Submission Info

Submission Time
Task C - Iroha's Obsession
User tomo0608
Language PyPy3 (2.4.0)
Score 300
Code Size 267 Byte
Status AC
Exec Time 194 ms
Memory 40924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status AC
AC × 10
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 163 ms 38256 KB
subtask0_sample_02.txt AC 160 ms 38256 KB
subtask1_X_01.txt AC 168 ms 38768 KB
subtask1_X_02.txt AC 194 ms 40924 KB
subtask1_X_03.txt AC 168 ms 38768 KB
subtask1_X_04.txt AC 160 ms 38256 KB
subtask1_X_05.txt AC 160 ms 38256 KB
subtask1_X_06.txt AC 168 ms 38768 KB
subtask1_X_07.txt AC 160 ms 38256 KB
subtask1_X_08.txt AC 161 ms 38256 KB