Submission #3727817

---

Source Code Expand

from functools import lru_cache

A, K = input().split()
K = int(K)

@lru_cache(maxsize=1000)
def digit_search(k, tight, number_s, X):
    if k == len(X):
        diff = abs(int(number_s) -int(A))
        return diff

    digit = int(X[k])
    lim = digit if tight else 9
    res = int(A)
    used_n = len(set(number_s))
    if used_n < K:
        res = min(
            digit_search(k+1, tight and digit==X[k],\
                         number_s+str(X[k]), X),\
            digit_search(k+1, tight and digit==str(int(X[k])-1),\
                         number_s+str(int(X[k])-1), X)
            )
    elif used_n == K:
        for i in set(number_s):
            res = min(res, digit_search(k+1, tight and digit==i,\
                                        number_s+str(i), X))
    else:
        pass


    return res

print(digit_search(0, True, "", A))

Submission Info

Judge Result