[Combination] baekjoon-11051

Author: Seogeurim

README.md

@@ -69,4 +69,5 @@
 
 |  #  |   ☆    | Problem                                                                                                             | Note                      |
 | :-: | :----: | :------------------------------------------------------------------------------------------------------------------ | :------------------------ |
-| 01  |     | [Baekjoon-11050 이항 계수 1](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/Combination/P11050) |      |
+| 01  |     | [Baekjoon-11050 이항 계수 1](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/Combination/P11050) |      |
+| 02  |     | [Baekjoon-11051 이항 계수 2](https://github.com/Seogeurim/Algorithm-practice/blob/master/src/Combination/P11051) | DP   |

src/Combination/P11051/Main.java

@@ -0,0 +1,30 @@
+package Combination.P11051;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int N,K;
+    static int combis[][];
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        K = Integer.parseInt(st.nextToken());
+
+        combis = new int[N+1][K+1];
+        for (int i = 1; i <= N; i++) {
+            for (int j = 0; j <= K; j++) {
+                if (j == 0 || i == j)
+                    combis[i][j] =  1;
+                else combis[i][j] = (combis[i-1][j-1] + combis[i-1][j]) % 10007;
+            }
+        }
+
+        System.out.println(combis[N][K]);
+    }
+}