백준 2225번 C++

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
const int MAX = 201;
const int MOD = 1000000000;
int n, k;
int num[MAX][MAX];

int calway(int sum, int counts) {
	if (counts == 1)
		return 1;

	int &answer = num[sum][counts];
	if (answer != -1)
		return answer;

	answer = 0;
	for (int i = 0; i <= sum; i++) {
		answer = (answer + calway(sum - i, counts - 1) * 1) % MOD;
	}
	return answer;
}

int main(void) {
	cin >> n >> k;

	memset(num, -1, sizeof(num));
	cout << calway(n, k) << endl;
	return 0;
}