[DP] baekjoon-2225

Author: Seogeurim

README.md

@@ -217,6 +217,7 @@
 | 25  |     | [Baekjoon-1912 연속합](src/DP/P1912) |      |
 | 26  |     | [Baekjoon-13398 연속합 2](src/DP/P13398) |      |
 | 27  |     | [Baekjoon-1699 제곱수의 합](src/DP/P1699) |      |
+| 28  |     | [Baekjoon-2225 합분해](src/DP/P2225) |      |
 
 ---
 

src/DP/P2225/Main.java

@@ -0,0 +1,31 @@
+package DP.P2225;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N, K;
+    static long[][] dp = new long[201][201];
+    final static int mod = 1000000000;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/DP/P2225/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        for (int i = 1; i <= K; i++) dp[0][i] = 1;
+        for (int i = 0; i <= N; i++) dp[i][1] = 1;
+
+        for (int i = 2; i <= K; i++) {
+            for (int j = 1; j <= N; j++) {
+                dp[j][i] = (dp[j-1][i] + dp[j][i-1]) % mod;
+            }
+        }
+
+        System.out.println(dp[N][K]);
+    }
+}

src/DP/P2225/README.md

@@ -0,0 +1,8 @@
+## [baekjoon-2225] 합분해
+
+![image](https://user-images.githubusercontent.com/22045163/101066300-8fb34d00-35d9-11eb-9e3f-49d0e881c450.png)
+
+![IMG_F5BB57C2137D-1](https://user-images.githubusercontent.com/22045163/101066443-c2f5dc00-35d9-11eb-909e-512e698956d3.jpeg)
+
+풀이가 낙서장처럼 엉망진창이긴 하지만, 곰곰이 잘 생각해보면 식을 도출할 수 있기 때문에 
+한 번 더 예쁘게 정리하지 않아도 될 것 같다 !!

src/DP/P2225/input.txt

@@ -0,0 +1 @@
+20 3