HDU 1130 how many trees(卡特兰数)

How Many Trees?

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2890 Accepted Submission(s): 1691

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) <label (k) and any node w reachable from its right has label (w) > label (k). It is a search structure which can find a node with label x in O(n log n) average time, where n is the size of the tree (number of vertices).

Given a number n, can you tell how many different binary search trees may be constructed with a set of numbers of size n such that each element of the set will be associated to the label of exactly one node in a binary search tree?

Input

The input will contain a number 1 <= i <= 100 per line representing the number of elements of the set.

Output

You have to print a line in the output for each entry with the answer to the previous question.

Sample Input

  
  

   
   1
2
3
  
  

Sample Output

  
  

   
   1
2
5
  
  

Source

UVA

Recommend

Eddy | We have carefully selected several similar problems for you: 1131 1134 1133 1023 2067

用c/c++会爆LL，可以使用高精度计算的板子。

java可以使用biginteger，终于翻身- -、

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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author DELL
 */
public class Main {
    public static Scanner cin = new Scanner(new BufferedInputStream(System.in));
    
    public static void main(String[] args){
        BigInteger[] f = new BigInteger[128];
        f[1] = BigInteger.ONE;
        for(int i = 2;i<101;i++){
            f[i] = f[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));
    }
        while(cin.hasNext()){
            System.out.println(f[cin.nextInt()]);
}
    }
}