HDU ACM 11 2067 小兔的棋盘（卡特兰数）

#include <iostream>
using namespace std;
int main()
{
int n, t = 1;
__int64 Lu[37];
while (cin >> n && n != -1)
{
Lu[0] = 1; Lu[1] = 1;
__int64 sum;
for (int i = 2; i <= n; i++)
{
sum = 0;
for (int j = 0; j < i; j++)
sum += Lu[j] * Lu[i - j - 1];
Lu[i] = sum;
}
cout << t << ' ' << n << ' ' << 2 * Lu
<< endl;
t++;
}
return 0;
}