Submission #53489045

---

Source Code Expand

N, K = map(int, input().split())
D = list(map(int, input().split()))


is_use = set([i for i in range(10)]) ^ set(D)
is_use = list(is_use)

INF = int(str(max(is_use))*len(str(N)))
if INF < N:
    INF *= 10
    INF += max(is_use)

# dp[S] := 集合 S (1~9) で作れる N 以上の最小値
dp = [INF]*(1 << 10)

for S in range(1 << 10):
    for i in range(10):
        len_ = len(str(dp[S]))
        for bit in range(1 << len_):
            num = list(str(dp[S]))
            for j in range(len_): 
                if (bit >> j) & 1:
                    num[j] = str(i)
            num = int("".join(num))
            if num >= N:
                dp[S | (1 << i)] = min(dp[S | (1 << i)], num)

ans = INF
use_bin = sum([(1 << i) for i in is_use])
for i in range(1 << 10):
    ans = min(ans, dp[i & use_bin])

print(ans)

Submission Info

Judge Result