📌문제
https://programmers.co.kr/learn/courses/30/lessons/42895
🎖️난이도
Level 3
✔️풀이
# sol
def solution(N,number):
answer=-1
S=[set() for x in range(8)]
for i,x in enumerate(S,start=1):
x.add(int(str(N)*i))
for i in range(1,len(S)):
for j in range(i):
for op1 in S[j]:
for op2 in S[i-j-1]:
S[i].add(op1+op2)
S[i].add(op1-op2)
S[i].add(op1*op2)
if op2!=0:
S[i].add(op1//op2)
if number in S[i]:
answer=i+1
break
return answer
print(solution(5,12))
'[ 알고리즘 ] > DP' 카테고리의 다른 글
[프로그래머스] 도둑질 (0) | 2022.06.29 |
---|---|
[프로그래머스] 등굣길 (0) | 2022.06.29 |
[프로그래머스] 정수 삼각형 (0) | 2022.06.29 |
[백준] 17979. What's Mine is Mine (0) | 2022.06.29 |
[백준] 17968. Fire on Field (0) | 2022.06.29 |