211216-N表示

# 코드
def solution(N, number):
    answer = -1
    dp = {i : set() for i in range(1, 9)}
    
    if N == number:
        answer = 1
        return answer

    dp[1].add(N)
    for i in range(2, 9):
        dp[i].add(int(str(N)*i))
        for half in range(1, i//2+1):
            for x in dp[half]:
                for y in dp[i-half]:
                    add, minus1, minus2, mul = x+y, x-y, y-x, x*y
                    if 0 < add <= 32000 :
                        dp[i].add(add)
                    if 0 < minus1 <= 32000:    
                        dp[i].add(minus1)
                    if 0 < minus2 <= 32000:
                        dp[i].add(minus2)
                    if 0 < mul <= 32000:
                        dp[i].add(mul)
                        
                    if y != 0:
                        quotient, mod = divmod(x, y)
                        if mod == 0 and 0 < quotient <= 32000:
                            dp[i].add(quotient)
                    if x != 0:
                        quotient, mod = divmod(y, x)
                        if mod == 0 and 0 < quotient <= 32000:
                            dp[i].add(quotient)
        if number in dp[i]:
            answer = i
            return answer

    return answer