[BOJ] #1463.1로 만들기 / 실버3 / 40(X)

Author: learntosurf

learntosurf/Dynamic Programming/2024-11-26-[BOJ]-#1463-1로만들기.py

@@ -0,0 +1,17 @@
+N = int(input())
+
+def operation(N):
+    dp = [0] * (N+1)
+    
+    for i in range(2, N+1): # 1은 연산이 필요하지 않음 
+        dp[i] = dp[i-1] + 1
+        
+        if i%2==0:
+            dp[i] = min(dp[i], dp[i//2]+1)
+        
+        if i%3==0:
+            dp[i] = min(dp[i], dp[i//3]+1)
+
+    return dp[N]
+
+print(operation(N))