(卡特兰数,二叉树数量)How Many Trees? &&Count the Trees -- HDOJ
来源:互联网 发布:北京矩阵联合营销顾问 编辑:程序博客网 时间:2024/05/18 01:25
How Many Trees?
Problem Description
A binary search tree is a binary tree with root k such that any node v reachable from its left has label (v)
import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) { BigInteger sum = BigInteger.ZERO; BigInteger []f = new BigInteger[101]; f[0] = BigInteger.ONE; for(int i =1;i<=100;i++){ f[i] = f[i-1].multiply(BigInteger.valueOf((4*i-2))).divide(BigInteger.valueOf(i+1)).multiply(BigInteger.valueOf(i)); } Scanner cin = new Scanner(System.in); while(cin.hasNext()) { int n = cin.nextInt(); BigInteger ans = BigInteger.valueOf(1); BigInteger t = BigInteger.valueOf(1); for(int i=n+1; i<=2*n; ++i) ans = ans.multiply(BigInteger.valueOf(i)); for(int i=2; i<=n; ++i) t = t.multiply(BigInteger.valueOf(i)); t = t.multiply(BigInteger.valueOf(n+1)); BigInteger res = ans.divide(t); System.out.println(res); } }}
Count the Trees
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.
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
Source
UVA
Recommend
Eddy
总结:
这道题相对上一道题来说,是节点变的不一样了,在每一种数的结构中,所有的节点还有进行排列,共有N!种,所以,在上题的基础上再乘以一个N!即可
import java.math.BigDecimal;import java.math.BigInteger;import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner cin = new Scanner(System.in); int cnt=1; while(cin.hasNext()) { int n; n = cin.nextInt(); if(0 == n) break; BigInteger ans = BigInteger.valueOf(1); BigInteger t = BigInteger.valueOf(1); for(int i=2; i<=2*n; ++i) ans = ans.multiply(BigInteger.valueOf(i)); for(int i=2; i<= n+1; ++i) t = t.multiply(BigInteger.valueOf(i)); System.out.println(ans.divide(t)); } }}
- (卡特兰数,二叉树数量)How Many Trees? &&Count the Trees -- HDOJ
- hdoj-1130-How Many Trees?【卡特兰数】
- hdoj 1130 How Many Trees? 【卡特兰数】
- uva 10303 - How Many Trees?(卡特兰数)
- hdu 1131 Count the Trees(n!*卡特兰数)
- HDU 1131Count the Trees(卡特兰数 大数)
- hdu1131 Count the Trees(卡特兰数)
- HDOJ 1130 How Many Trees?(卡特兰数+大数乘除法)
- ACMSTEP 2.3.5 How Many Trees? //高精度卡特兰数
- UVa 10303 How Many Trees? (卡特兰数&高精度)
- HDU 1130 How Many Trees? 卡特兰数
- HDU 1130 how many trees(卡特兰数)
- HDU 1130 How Many Trees?(卡特兰数+大数)
- HDU 1130 How Many Trees卡特兰数
- Count the Trees-卡特兰数\高精度乘法
- HDU 1131 Count the Trees 卡特兰数的应用
- hdu 1131 Count the Trees (卡特兰数的应用)
- hdu 1131 Count the Trees 卡特兰数+java
- java---接口(特点、举例体现)
- eclipse设置、调优、使用
- LINUX 学习笔记
- audio 模块
- [Qt] 利用QtWebKit完成JavaScript访问C++对象
- (卡特兰数,二叉树数量)How Many Trees? &&Count the Trees -- HDOJ
- archive 生成的ipa 比 bulid然后拖到itunes里生成的ipa要小7、8M
- fio使用(windows+linux)
- 【Java】编程过程中遇到的中文编码问题
- Hdu 1671 -Phone List (字典树模板)
- [RK3288][Android6.0] WiFi之与ConnectivityService的交互
- 开发中遇见的问题汇总
- Java中如何遍历Map对象的4种方法
- C++中的string 类 简单介绍