Count the Trees(依旧是Catalan数的变化)

Count the Trees

题目大意:给你n个节点,问能构成多少个不同的二叉树,不过这里的节点都用字母表示,也就意味着每个节点的编号
是不一样的,所以只要找出n个节点能构成多少形状不同的二叉树,在乘上A(n,n),就可以了。而正好n个节点所能构成的二叉树的个数就是Catalan数。由于Catalan数的增长快的惊人,第19个数就会超出10^9,所以逢Catalan,必定要用大数
乘除运算。



Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 16   Accepted Submission(s) : 14
Font: Times New Roman | Verdana | Georgia
Font Size:  

Problem Description

Another common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common among programmers. It can be described as the temporary (although frequent) loss of the faculty of speech when the whole power of the brain is applied to something extremely interesting or challenging. 
Juan is a very gifted programmer, and has a severe case of ACM (he even participated in an ACM world championship a few months ago). Lately, his loved ones are worried about him, because he has found a new exciting problem to exercise his intellectual powers, and he has been speechless for several weeks now. The problem is the determination of the number of different labeled binary trees that can be built using exactly n different elements. 

For example, given one element A, just one binary tree can be formed (using A as the root of the tree). With two elements, A and B, four different binary trees can be created, as shown in the figure. 
Count the Trees(依旧是Catalan数的变化) - 836699979 - 836699979的博客
If you are able to provide a solution for this problem, Juan will be able to talk again, and his friends and family will be forever grateful. 

Input

The input will consist of several input cases, one per line. Each input case will be specified by the number n ( 1 ≤ n ≤ 100 ) of different elements that must be used to form the trees. A number 0 will mark the end of input and is not to be processed. 

Output

For each input case print the number of binary trees that can be built using the n elements, followed by a newline character. 

Sample Input

1
2
10
25
0

Sample Output

1
4
60949324800
75414671852339208296275849248768000000

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX 100
#define BASE 10000
void multiply(int a[],int Max,int b)
{
int i,array=0;
for(i=Max-1;i>=0;i--)
{
array+=b*a[i];
a[i]=array%BASE;
array/=BASE;
}
}
void divide(int a[],int Max,int b)
{
int i,div=0;
for(i=0;i<Max;i++)
{
div=div*BASE+a[i];
a[i]=div/b;
div%=b;
}
}
int main(int argc, char *argv[])
{
int a[101][MAX],i,j,n;
memset(a[1],0,MAX*sizeof(int));
for(i=2,a[1][MAX-1]=1;i<101;i++)
{
memcpy(a[i],a[i-1],MAX*sizeof(int));
multiply(a[i],MAX,4*i-2);
multiply(a[i],MAX,i);\\这里仅仅多加了一步就可以了,还是比较好来理解的
divide(a[i],MAX,i+1);
}
while(cin>>n)
{
if(n==0) break;
for(i=0;i<MAX&&a[n][i]==0;i++) ;
cout<<a[n][i++];
for(;i<MAX;i++) printf("%04d",a[n][i]);
cout<<endl;
}
return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值