From 9bb1867a432daf1e433988677559d81a37b5f903 Mon Sep 17 00:00:00 2001
From: SeoMoonk <39723465+SeoMoonk@users.noreply.github.com>
Date: Wed, 17 May 2023 17:03:02 +0900
Subject: [PATCH 1/2] =?UTF-8?q?p2293=5F=EB=8F=99=EC=A0=841=5FDP?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../p2293.java"                               | 51 +++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 "10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2293.java"

diff --git "a/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2293.java" "b/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2293.java"
new file mode 100644
index 0000000..23b42e1
--- /dev/null
+++ "b/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2293.java"
@@ -0,0 +1,51 @@
+package p2293;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class p2293 {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+        int k = sc.nextInt();
+
+        int[] coins = new int[n];
+
+        for(int i=0; i<n; i++) {
+            coins[i] = sc.nextInt();
+        }
+
+        int result = dynamic(k, coins);
+
+        System.out.println(result);
+
+    }
+
+    public static int dynamic(int k, int[] coins){
+
+        //dp = 각 i 원을 만들기 위한 방법의 수 배열
+        int[] dp = new int[k + 1];
+
+        dp[0] = 1;
+
+
+        for(int i=0; i<coins.length; i++)
+        {
+            int now_coin = coins[i];
+
+            //A += B
+            //ex) 이전에 B를 만들어 두었다면, A를 만들때 해당 경우의 수를 사용할 수 있음(갱신)
+            for(int j=now_coin; j <= k; j++)
+            {
+                dp[j] += dp[j - now_coin];
+            }
+        }
+
+        //k를 만들기 위한 방법의 수는?
+        return dp[k];
+    }
+
+}

From f081fc89e9d80ca256ba192b79c35353fe8a6355 Mon Sep 17 00:00:00 2001
From: SeoMoonk <39723465+SeoMoonk@users.noreply.github.com>
Date: Wed, 17 May 2023 17:10:04 +0900
Subject: [PATCH 2/2] =?UTF-8?q?p2294=5F=EB=8F=99=EC=A0=842=5FDP?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../p2294.java"                               | 60 +++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 "10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2294.java"

diff --git "a/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2294.java" "b/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2294.java"
new file mode 100644
index 0000000..83fb912
--- /dev/null
+++ "b/10\354\243\274\354\260\250/p2293/\352\271\200\354\204\261\355\233\210/p2294.java"
@@ -0,0 +1,60 @@
+package p2293;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class p2294 {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+        int k = sc.nextInt();
+
+        int[] coins = new int[n];
+
+        for(int i=0; i<n; i++) {
+            coins[i] = sc.nextInt();
+        }
+
+        int result = dynamic(k, coins);
+
+        System.out.println(result);
+
+    }
+
+    public static int dynamic(int k, int[] coins){
+
+        int result = 0;
+
+        //dp = 각 i 원을 만들기 위한 방법의 수 배열
+        int[] dp = new int[k + 1];
+        Arrays.fill(dp, k+1);
+        dp[0] = 0;
+
+
+        for(int i=0; i<coins.length; i++)
+        {
+            int now_coin = coins[i];
+
+            for(int j=now_coin; j <= k; j++)
+            {
+                //어떤 경우가 더 작은 동전 개수로 목표값을 만들어낼 수 있는가?
+                dp[j] = Math.min(dp[j], dp[j - now_coin] + 1);
+            }
+        }
+
+        //만들 수 있는 경우, 아닌 경우
+        //(초기에 k+1 로 초기화한게 갱신되지 않은 경우 -1 반환)
+        if(dp[k] > k){
+            result = -1;
+        }
+        else {
+            result = dp[k];
+        }
+
+        return result;
+    }
+
+}