这是一个DP,由一个公式推出来的。可以通过参考百度的博客来理解
#include<iostream>
using namespace std;
long long a[37][37] = { 0 };
int main()
{
int n; int i = 1;
for (int i = 0; i <=36; i++)
{
a[i][0] = 1;
}
for (int i = 1; i <= 36; i++)
{
for (int j = 1; j <=i; j++)
a[i][j] = a[i - 1][j] + a[i][j - 1];
}
while (cin>>n)
{
if (n == -1)
break;
cout <<i<<" "<<n<<" "<< 2*a[n][n] << endl;
i++;
}
}