Development/CodingTest
[ํ๋ก๊ทธ๋๋จธ์ค] Python N์ผ๋ก ํํ
Kirok Kim
2022. 2. 1. 22:40
def solution(N, number):
answer = -1
dp = [] # N ๊ฐฏ์ ํ์
์ํ ๋ฆฌ์คํธ
for i in range (1,9) :
result = set() # ์ฐ์ฐ ๊ฒฐ๊ณผ ๊ฐ
n2 = int(str(N)* i) # N์ผ๋ก ๋ง๋ค ์ ์๋ ์ซ์
result.add(n2)
for j in range(0,i-1): # ex) 3 = 2์ฐ์ฐ1 ๋๋ 1์ฐ์ฐ2 ๋๋ 3
for op1 in dp[j]:
for op2 in dp[-j-1] :
result.add(op1 - op2)
result.add(op1 + op2)
result.add(op1 * op2)
if op2 != 0:
result.add(op1 // op2)
if number in result:
answer = i
break
dp.append(result) # N ๊ฐฏ์ ํ์
์ํ ๋ฆฌ์คํธ
return answer
๋ฐ์ํ