HDU - 1131 Count the Trees
来源:互联网 发布:oppoa100软件下载 编辑:程序博客网 时间:2024/06/16 08:57
题目:
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
这个只是在二叉搜索树之上加一个全排列。
关于二叉搜索树的计数 点击打开链接
import java.util.*;import java.math.BigInteger;public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(true) { int n=Integer.parseInt(cin.nextLine()); if(n==0)break; BigInteger s=new BigInteger("1"); for(int i=1;i<=n;i++)s=s.multiply(BigInteger.valueOf(i)); n--; for(int i=n+3;i<=n*2+2;i++)s=s.multiply(BigInteger.valueOf(i)); for(int i=1;i<=n+1;i++)s=s.divide(BigInteger.valueOf(i)); System.out.println(s.toString()); } }}
0 0
- hdu 1131 Count the Trees
- hdu 1131 Count the Trees
- hdu-1131 Count the trees
- HDU 1131 Count the trees
- hdu 1131 Count the Trees
- HDU 1131 Count the Trees
- HDU - 1131 Count the Trees
- hdu 1131 Count the Trees Java 大数
- HDOJ HDU 1131 Count the Trees
- hdu 1131 Count the Trees(catalan数的应用)
- hdu 1131 Count the Trees # java水大数
- hdu 1131 Count the Trees(n!*卡特兰数)
- HDU 1131Count the Trees(卡特兰数 大数)
- HDU 1131 Count the Trees 卡特兰数的应用
- hdu 1131 Count the Trees (卡特兰数的应用)
- hdu 1131 Count the Trees 卡特兰数+java
- hdoj-1131-Count the Trees
- hdoj 1131 Count the Trees
- 分享45个Android实例源码
- JDBC基础(JDBCVersion1)
- 【严肃脸】使用caffe实现色情图片的识别
- BZOJ3939 BSOJ4853 【USACO 2015 FEB GOLD 】cow hopscotch
- Markdown学习与集成
- HDU - 1131 Count the Trees
- HDU Fraction 2016中国大学生程序设计竞赛(长春)-重现赛
- 【Codeforces 718C&719E】Sasha and Array【线段树成段更新+矩阵快速幂】
- 关于hibernate中实体类为什么尽量序列化和类似<s:checkboxlist/>标签
- [LeetCode]318. Maximum Product of Word Lengths
- 为什么罗永浩这种人都能做出来锤子手机?
- test
- ZOJ 3329 One Person Game
- KMP的next数组