[백준] 11051번 이항 계수 2 C++

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

#include <iostream>

using namespace std;

long long x[1001][1001] = { 0, };

int main(void)
{
	int N, K;
	cin >> N >> K;
	x[0][0] = 1;
	x[1][0] = 1;
	x[1][1] = 1;
	for (int i = 2; i <= N; i++)
	{
		for (int j = 0; j <= i; j++)
		{
			if (j == 0)
				x[i][j] = 1;
			else
				x[i][j] = (x[i - 1][j - 1] + x[i - 1][j]) % 10007;
		}
	}

	cout << x[N][K] % 10007;
	return 0;
}