hdu 1130(How Many Trees?)

题目大意:输入一棵树的节点数，求这棵树有多少颗二叉树

解题思路:卡特兰公式  h(n ) = h(n-1)*(4*n-2) / (n+1);(咦？？貌似这个递推公式产生的数也不怎么大，，为什么要用大数？？？哈哈哈你随便输入一个100就知道大不大了。。。)

代码如下:

package com.njupt.bigInteger;

import java.math.BigInteger;
import java.util.Scanner;

public class HDU_1130_1 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		BigInteger one = new BigInteger("1");
		//BigInteger one1 =BigInteger.ONE;等价于上面的那一种写法
		BigInteger two = new BigInteger("2");
		BigInteger four = new BigInteger("4");
		
		BigInteger N ;
		
		
		while(scanner.hasNextInt()){
			int n = scanner.nextInt();
			BigInteger catalan = one;
			for(int i = 1 ; i <= n ; ++i){
				N = new BigInteger(String.valueOf(i));
				catalan = catalan.multiply(four.multiply(N).subtract(two)).divide(N.add(one));
				
			}
			System.out.println(catalan);
			
			
		}
	}
}