[BAE/<JOON> 문제풀이] 이항계수 2 (DP.026)

https://www.acmicpc.net/problem/11051

11051번: 이항 계수 2

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int> > arr;
    arr.resize(n + 2);
    for (int i = 1; i <= n + 1; i++) {
        arr[i].resize(n + 2);
    }
    arr[1][1] = 1;    
    for (int i = 2; i <= n + 1; i++) {
        for (int j = 1; j <= i; j++) {
            arr[i][j] = (arr[i - 1][j] + arr[i - 1][j - 1]) % 10007;
        }
    }
    /*for (int i = 1; i <= n + 1; i++) {
        for (int j = 1; j <= i; j++) {
            cout << arr[i][j] << " ";
        }
        cout << "\n";
    }*/
    cout << arr[n + 1][k + 1];

    return 0;
}