14-redish03

Redish03/Backtracking/15663.cpp

@@ -0,0 +1,65 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int arr[10];
+int N, M;
+int current[8];
+int previ[8];
+bool used[8];
+
+bool check_duplicate()
+{
+    for (int i = 0; i < M; i++)
+    {
+        if (current[i] != previ[i])
+        {
+            return false;
+        }
+    }
+    return true;
+}
+
+void find_arr(int count)
+{
+    if (count == M)
+    {
+        if (check_duplicate())
+        {
+            return;
+        }
+        for (int i = 0; i < M; i++)
+        {
+            previ[i] = current[i];
+            cout << current[i] << " ";
+        }
+        cout << '\n';
+
+        return;
+    }
+
+    int tmp = 0;
+    for (int i = 0; i < N; i++)
+    {
+        if (used[i] || tmp == arr[i])
+            continue;
+        current[count] = arr[i];
+        tmp = arr[i];
+        used[i] = true;
+        find_arr(count + 1);
+        used[i] = false;
+    }
+}
+
+int main()
+{
+    cin >> N >> M;
+    for (int i = 0; i < N; i++)
+    {
+        cin >> arr[i];
+    }
+    sort(arr, arr + N);
+
+    find_arr(0);
+}

Redish03/DP/12865.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+
+using namespace std;
+
+int N, K;
+int dp[101][100001];
+int weight[101];
+int value[101];
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+    cin >> N >> K;
+
+    for (int i = 1; i <= N; i++)
+    {
+        cin >> weight[i] >> value[i];
+    }
+
+    for (int i = 1; i <= N; i++)
+    {
+        for (int j = 1; j <= K; j++)
+        {
+            if (j >= weight[i])
+            {
+                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weight[i]] + value[i]);
+            }
+            else
+            {
+                dp[i][j] = dp[i - 1][j];
+            }
+        }
+    }
+
+    cout << dp[N][K];
+}

Redish03/README.md

@@ -13,6 +13,8 @@
 | 9차시  | 2024.01.25 | Back tracking |          [N과 M(7)](https://www.acmicpc.net/problem/15656)          | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/35)  |
 | 10차시 | 2024.01.28 |      DP       |          [내려가기](https://www.acmicpc.net/problem/2096)           | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/41) |
 | 11차시 | 2024.01.31 |    Greedy     |        [삼각형 만들기](https://www.acmicpc.net/problem/1448)        | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/44) |
-| 12차시 | 2024.02.03 |      DP       |      [구간 합 구하기 5](https://www.acmicpc.net/problem/11660)      | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/44) |
+| 12차시 | 2024.02.03 |      DP       |      [구간 합 구하기 5](https://www.acmicpc.net/problem/11660)      | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/47) |
+| 13차시 | 2024.02.06 | Back tracking |          [N과 M(9)](https://www.acmicpc.net/problem/15663)          | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/52) |
+| 14차시 | 2024.02.12 | KnapSack(DP)  |        [평범한 배낭](https://www.acmicpc.net/problem/12865)         | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/55) |
 
 ---