Merge pull request #156 from YoonYn9915/main

YoonYn9915/ 3월 3주차/ 3문제

Author: YoonYn9915

YoonYn9915/dp/2025-03-22-[백준]-#2193-이친수.py

@@ -0,0 +1,13 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+
+dp = [0] * (n + 1)
+dp[1] = 1
+
+for i in range(2, n + 1):
+    dp[i] = dp[i - 2] + dp[i - 1]
+
+print(dp[n])

YoonYn9915/dp/2025-03-22-[백준]-#2293-동전 1.py

@@ -0,0 +1,16 @@
+n, k = map(int, input().split())
+
+coin = []
+dp = [0] * (k + 1)
+
+for _ in range(n):
+    coin.append(int(input()))
+
+coin.sort()
+dp[0] = 1
+
+for c in coin:
+    for i in range(c, k+1):
+        dp[i] += dp[i-c]
+
+print(dp[k])

YoonYn9915/dp/2025-03-22-[백준]-#2294-동전 2.py

@@ -0,0 +1,37 @@
+
+
+n, k = map(int, input().split())
+
+coins = []
+dp = [[-1] * (k + 1) for _ in range(n + 1)]
+for _ in range(n):
+    coins.append(int(input()))
+
+for i in range(1, n + 1):
+    for j in range(1, k + 1):
+
+        if i == 1:
+            # 첫번째 열일때 나누어 떨어지면 몫을 나누어 떨어지지 않으면 -1을 저장한다.
+            if j % coins[i-1] == 0:
+                dp[i][j] = j // coins[i-1]
+        else:
+
+            if j <= coins[i-1]:
+                # 현재 동전의 가치와 딱 나누어 떨어지는 경우
+                if coins[i-1] == j:
+                    dp[i][j] = 1
+                else:
+                    dp[i][j] = dp[i-1][j]
+            else:
+                if dp[i][j - coins[i-1]] != -1 and dp[i - 1][j] != -1:
+                    dp[i][j] = min(dp[i][j - coins[i-1]] + 1, dp[i - 1][j])
+                elif dp[i][j - coins[i-1]] == -1 and dp[i - 1][j] == -1:
+                    dp[i][j] = -1
+                elif dp[i][j - coins[i-1]] == -1:
+                    dp[i][j] = dp[i - 1][j]
+                else:
+                    dp[i][j] = dp[i][j - coins[i-1]] + 1
+
+
+
+print(dp[n][k])