[20251203] BOJ / G5 / 합분해 / 설진영

Implement dynamic programming solution for the 합분해 problem.

Author: Seol-JY

Seol-JY/202512/03 BOJ G5 합분해.md

@@ -0,0 +1,32 @@
+```java
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static final int MOD = 1_000_000_000;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        int N = Integer.parseInt(st.nextToken());
+        int K = Integer.parseInt(st.nextToken());
+        
+        int[][] dp = new int[K + 1][N + 1];
+        
+        for (int n = 0; n <= N; n++) {
+            dp[1][n] = 1;
+        }
+        
+        for (int k = 2; k <= K; k++) {
+            dp[k][0] = 1;
+            for (int n = 1; n <= N; n++) {
+                dp[k][n] = (dp[k][n - 1] + dp[k - 1][n]) % MOD;
+            }
+        }
+        
+        System.out.println(dp[K][N]);
+    }
+}
+```