11-dohyeondol1

dohyeondol1/DP/11-dohyeondol1.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+	int n, k;
+	cin >> n >> k;
+	vector<int> coin(n);
+	vector<int> dp(k+1);
+	for(auto& c : coin)
+		cin >> c;
+
+	dp[0] = 1;
+	for(int i = 0; i < n; i++)
+		for(int j = coin[i]; j <= k; j++) 
+			dp[j] += dp[j - coin[i]];
+
+	cout<< dp[k] << '\n';
+
+	return 0;
+}

dohyeondol1/README.md

@@ -10,3 +10,6 @@
  | 6차시 | 2025.04.05 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/22|
  | 7차시 | 2025.04.08 |  트리  | [트리 순회](https://www.acmicpc.net/problem/1991)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/26|
  | 8차시 | 2025.04.11 |  덱  | [회전하는 큐](https://www.acmicpc.net/problem/1021)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/32|
+ | 9차시 | 2025.04.30 |  그리디 알고리즘  | [체육복](https://school.programmers.co.kr/learn/courses/30/lessons/42862)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/33|
+ | 10차시 | 2025.05.04 |  완전 탐색  | [소수 찾기](https://school.programmers.co.kr/learn/courses/30/lessons/42839)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/37|
+ | 11차시 | 2025.05.06 |  DP  | [동전 1](https://www.acmicpc.net/problem/2293)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/39|