조예지

from collections import deque def solution(N, number): DP = [set() for _ in range(9)] pre = [N, N*11, N*111, N*1111, N*11111, N*111111, N*1111111] for i in range(len(pre)): if pre[i] == number: return i+1 DP[i+1].add(pre[i]) for i in range(2, 9): for j in range(1, i): for k in DP[i-j]: for h in DP[j]: DP[i].add(k+h) DP[i].add(k-h) DP[i].add(k*h) if h != 0: DP[i].add(k//h) if number in DP[i]: return i return -1