Count the Trees
来源:互联网 发布:centos 安装 tomcat 编辑:程序博客网 时间:2024/06/01 08:52
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.
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.
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.
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
1210250
Sample Output
146094932480075414671852339208296275849248768000000
Source
UVA
Recommend
Eddy
卡特兰数,对于n个数组成的二叉树结果是h(n)=c(2n,n)/(n+1),又有n个数是不相同的所以结果为h(n)*n!,化简得(2*n)*(2*n-1)!……*(n+2)
代码:
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int a[101][301]; int b[301]; int main() { int i,j,x,temp,len,n; memset(a,0,sizeof(a)); a[0][0]=a[1][0]=1; for(i=3;i<101;i++) { memset(b,0,sizeof(b)); b[0]=1; for(int k=i+2;k<=i*2;k++) for(j=0,x=0;j<301;j++) { temp=k*b[j]+x; x=temp/10; b[j]=temp%10; } memcpy(a[i],b,301*sizeof(int)); } while(cin>>n,n) { if(n==1) { cout<<"1"<<endl; continue; } else if(n==2) { cout<<"4"<<endl; continue;} len=300; while(len>=0&&a[n][len]==0) len--; for(j=len;j>=0;j--) { cout<<a[n][j]; } cout<<endl; } return 0; }
阅读全文
1 0
- UVa10007 - Count the Trees
- Count the Trees
- Count the Trees
- hdu 1131 Count the Trees
- hdu 1131 Count the Trees
- ZOJ 3602Count the Trees
- ZOJ 3602 Count the Trees
- UVA - 10007 Count the Trees
- hdu-1131 Count the trees
- UVa 10007 - Count the Trees
- ZOJ 3602 Count the Trees
- HDU 1131 Count the trees
- hdoj-1131-Count the Trees
- hdu 1131 Count the Trees
- hdoj 1131 Count the Trees
- ZOJ 3602Count the Trees
- HDU 1131 Count the Trees
- uva 10007 Count the Trees
- Spring 深入浅出核心技术(三)
- JAVA(学习笔记1.1.3)——API与DULL文件
- Redis+Twemproxy+HAProxy集群
- 面试题杂记
- 实现 extend 函数
- Count the Trees
- JUnit4单元测试框架使用
- 数字的来源及数据思维的发展
- 软件工程(C编码实践篇)学习总结
- 数学概念实际意义探究小记
- Werkzeug 库以及 wrapper 模块
- Internet常用术语及含义
- C++之字符串
- php debug 方法