We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6b9801c commit 83994e7Copy full SHA for 83994e7
1 file changed
live10/test102/문제3/백한결.py
@@ -0,0 +1,21 @@
1
+from collections import deque
2
+
3
+def solution(x, y, n):
4
+ answer = 0
5
+ dp = [-1] * (y + 1)
6
7
+ dp[x] = 0
8
9
+ queue = deque([x])
10
11
+ while queue:
12
+ current = queue.popleft()
13
14
+ for nextNum in (current + n, current * 2, current * 3):
15
+ if nextNum > y:
16
+ continue
17
+ if dp[nextNum] == -1:
18
+ dp[nextNum] = dp[current] + 1
19
+ queue.append(nextNum)
20
21
+ return dp[y]
0 commit comments