[11051] 이항 계수 2

#include <iostream>
using namespace std;
#define MAX 1001
int bin_coef_DP(int n, int k);
int C[MAX][MAX];
int main()
{
	int n, k;
	cin >> n >> k;
	cout << bin_coef_DP(n, k) << endl;
	return 0;
}
int bin_coef_DP(int n, int k)
{
	int i, j;
	C[0][0] = C[0][1] = C[1][0] = 1;
	for (i = 1; i <= n; i++)
	{
		for (j = 0; j <= i; j++)
			if (j == i || j == 0) 
				C[i][j] = 1;
			else 
				C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 10007;
	}
	return C[n][k];
}