hdu 2067 小兔的棋盘

//简单dp
#include<iostream>
using namespace std;
__int64 a[37][37];

int main()
{
int i, j;
for( i=1; i < 37; i++ )
a[0][i] = 1;
for( i=1; i < 36; i++ )
{
for( j=i; j < 37; j++ )
a[i][j] = a[i-1][j] + a[i][j-1];
}
int n;
i = 1;
while(scanf("%d", &n) != EOF && n != -1)
printf("%d %d %I64d\n", i++, n, 2*a

);
return 0;
}