부녀회장이 될테야 (2775번)

#include <iostream>
using namespace std;

int main()
{
	int T, k, n;
	int count = 0;
	int sum = 0;
	int *ptr;
	cin >> T;

	while (count < T)
	{
		cin >> k >> n;
		ptr = new int[n];

		for (int i = 0; i < n; i++)
		{
			ptr[i] = i + 1;
		}

		if (k == 0)
		{
			cout << ptr[n - 1] << "\n";
		}
		else
		{
			for (int i = 0; i < k; i++)
			{
				for (int j = 0; j < n; j++)
				{
					for (int m = 0; m < n - j; m++)
					{
						sum += ptr[n - 1 - j - m];
					}
					ptr[n - 1 - j] = sum;
					sum = 0;
				}
			}
			cout << ptr[n - 1] << "\n";
		}
		delete[] ptr;
		count++;
	}

	return 0;
}