UVA - 10007 Count the Trees
来源:互联网 发布:淘宝女服装 编辑:程序博客网 时间:2024/06/14 16:22
Description
![Download as PDF Download as PDF](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
Count the Trees
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 exactlyn different elements.
For example, given one element A, just one binary tree can be formed (usingA as the root of the tree). With two elements, A and B, four different binary trees can be created, as shown in the figure.
![\begin{picture}(400,90)(50,0)\put(115,62){A}\put(75,10){B}\put(120,60){\vecto......}}\put(365,62){B}\put(405,10){A}\put(370,60){\vector(1,-1){40}}\end{picture}](http://uva.onlinejudge.org/external/100/10007img1.gif)
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 numbern ( 1 ≤ n ≤ 300 ) of different elements that must be used to form the trees. A number0 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
题意:卡特兰数
思路:JAVA练手
import java.math.BigInteger;import java.util.*;import java.io.*;/** * Created by acer on 14-8-7. */public class Main {public static void main(String[] args) {Scanner cin = new Scanner(System.in);BigInteger[] catalan = new BigInteger[301], fact = new BigInteger[601];int n;fact[0] = BigInteger.ONE;for (int i = 1; i <= 600; i++)fact[i] = fact[i-1].multiply(BigInteger.valueOf(i));for (int i = 0; i <= 300; i++)catalan[i] = fact[i*2].divide(fact[i+1]).divide(fact[i]);while ((n = cin.nextInt()) != 0)System.out.println(catalan[n].multiply(fact[n]));}}
- UVA - 10007 Count the Trees
- UVa 10007 - Count the Trees
- uva 10007 Count the Trees
- UVA 10007Count the Trees (dp)
- UVa 10007 & hdu 1131 Count the Trees (卡特兰数)
- 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
- hdu-1131 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
- 复数运算
- 【2014 Multi-University Training Contest 6】 G. Series 1(n阶差分,组合数,大数)
- 【转移通知】博客停用通知
- 初等数学导论:传球游戏
- Windows上面编译和简单测试一下leveldb
- UVA - 10007 Count the Trees
- Oakley Cycling Glasses obama tidies up split via piste to travel to sick and tired nanna
- Oakley Frogskin Sunglasses My own hands ended up being blister morning via retaining your gun and al
- 学生管理系统
- Oakley Straight Jackets lodges having balconies throughout seattle
- Discount Oakley Sunglasses anthony can take video recording deposit on municipal instance
- Oakley Flak Jacket Sunglasses Elvin remained with all the music group for the purpose of 5 a long ti
- 排列组合
- 25个增强iOS应用程序性能的提示和技巧(高级篇)