HDU 1130 How Many Trees? HDU 1023 Train Problem II(卡特兰数)

How Many Trees?
import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    static int n = 0;
    static void solve(){
        BigInteger ans = new BigInteger("1");
        for(int i = 1; i <= n; i++){
            ans = ans.multiply(new BigInteger(String.valueOf(4 * i - 2)))
                    .divide(new BigInteger(String.valueOf(i + 1)));
        }
        System.out.println(ans);
    }
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        while(in.hasNext()){
            n = in.nextInt();
            solve();
        }
    }
}

猜你喜欢

转载自blog.csdn.net/ccshijtgc/article/details/80914466