Merge pull request #120 from AlgorithmWithGod/lkhyun

[20250214] BOJ / 골드3 / 동전 / 이강현

Author: ShinHeeEul

lkhyun/202502/14 BOJ 골드3 동전.md

@@ -0,0 +1,46 @@
+```java
+import java.util.*;
+import java.io.*;
+public class Main{
+    public static void main(String[] args) throws Exception{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int X = Integer.parseInt(st.nextToken());
+
+        int[] info = new int[4];
+        int[][] dp = new int[X+1][5]; 
+        int[] coins = {1,5,10,25};
+        for(int i=0;i<4;i++){
+            info[i] = Integer.parseInt(st.nextToken());
+        }
+        for(int i=0;i<=X;i++){
+            Arrays.fill(dp[i],-1);
+        }
+        for(int i=0;i<5;i++){
+            dp[0][i] = 0;
+        }
+        for(int i=1;i<=X;i++){
+            for(int j = 0;j<4;j++){
+                if(dp[i][j]==-1){dp[i][j]=0;}
+                if(i-coins[j]<0){
+                    continue;
+                }
+                if(dp[i-coins[j]][4]>dp[i][4]){
+                    if(info[j] > dp[i-coins[j]][j]){
+                        for(int k=0;k<=4;k++){
+                            dp[i][k] = dp[i-coins[j]][k];
+                        }
+                        dp[i][j]++;
+                        dp[i][4]++;
+                    }
+                }
+            }
+        }
+        for(int i=0;i<4;i++){
+            bw.write(dp[X][i]+" ");
+        }
+        bw.flush();
+    }
+}
+```