FAFU-1033 加括号 卡特兰数

题目链接

h(n)=h(n-1)*(4*n-2)/(n+1);

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 105;
int ct[maxn][maxn],len[maxn];
void catalan()
{
	ct[1][0] = len[1] = 1;
	for( int i = 2; i <= 100; i ++ ){
		int m = 4*i-2,carry = 0;
		len[i] = len[i-1];
		for( int j = 0; j < len[i]; j ++ ){         //乘
			ct[i][j] = ct[i-1][j] * m + carry;
			carry = ct[i][j]/10;
			ct[i][j] %= 10;
		}
		while( carry ){                             //进位
			ct[i][len[i]++] = carry % 10;
			carry /= 10;
		}

		m = i+1;
		carry = 0;
		for( int j = len[i]-1; j >= 0; j -- ){      //除
			int temp = ct[i][j] + carry*10;
			carry = temp % m;
			ct[i][j] = temp / m;
		}
		while( ct[i][len[i]-1] == 0 )               //处理前导零
			len[i] --;
	}
}  
int main()
{
    //freopen("data.txt","r",stdin);  
	int n;
	catalan();
	while( scanf("%d",&n) != EOF ){
		for( int i = len[n-1]-1; i >= 0; i -- )
			printf("%d",ct[n-1][i]);
		puts("");
	}
    return 0;
}