내 풀이

Author: seongdong2

Diff for: 연습 예제 모음/217.py

@@ -3,15 +3,16 @@
 
 for i in range(2, x+1):
     d[i] = d[i-1]-1
-    if d[i]%5==0 :
+    if i%5==0 :
         d[i] = min(d[i], (d[i]//5)+1)
-    if d[i]%2==0 :
+    if i%2==0 :
         d[i] = min(d[i], (d[i]//2)+1)
-    if d[i]%3==0 :
+    if i%3==0 :
         d[i] = min(d[i], (d[i]//2)+1)
 
 print(d[x])
 
+
 
 
 

Diff for: 정리.py

@@ -22,6 +22,7 @@ def bfs(gragh, start, visited):
                 queue.append(i)
                 visited[i] = True
 
+
 #선택정렬, O(N**2)
 array = []
 for i in range(len(array)) :
@@ -39,6 +40,7 @@ def bfs(gragh, start, visited):
         else :
             break
 
+
 #퀵 정렬, O(NlogN) 
 def quick(array):
     if len(array) <= 1 :