HDOJ Problem-1130、Problem-1134 (卡特兰数以及卡特兰数的应用！！)

例子：

Problem-1130 How Many Trees?（去AC请点我）

Problem-1134 Game of Connections (去AC这道题请点我)

详情请点击下面两个博客：

1、https://blog.csdn.net/zuzhiang/article/details/77966726

2、https://blog.csdn.net/qq_18661257/article/details/47210457

AC代码（简直是一模一样）：

#include<iostream>

using namespace std;

int a[101][101],b[101];

void catalan() //求卡特兰数
{
    int i, j, len, carry, temp;
    a[1][0] = b[1] = 1;
    len = 1;
    for(i = 2; i <= 100; i++)
    {
        for(j = 0; j < len; j++) //乘法
        	a[i][j] = a[i-1][j]*(4*(i-1)+2);
        carry = 0;
        for(j = 0; j < len; j++) //处理相乘结果
        {
            temp = a[i][j] + carry;
            a[i][j] = temp % 10;
            carry = temp / 10;*-
        }
        while(carry) //进位处理
        {
            a[i][len++] = carry % 10;
            carry /= 10;
        }
        carry = 0;
        for(j = len-1; j >= 0; j--) //除法
        {
            temp = carry*10 + a[i][j];
            a[i][j] = temp/(i+1);
            carry = temp%(i+1);
        }
        while(!a[i][len-1]) //高位零处理
        	len --;
        b[i] = len;
    }
}

int main()
{
	catalan();
	int n;
	while(~scanf("%d",&n))
	{
		if(n==-1) break;
		for(int i=b[n]-1;i>=0;i--)
			printf("%d",a[n][i]);
		printf("\n");
	}
	return 0;
}