HDU-1134 卡特兰数+java大数模板

 1 import java.math.*; 
 2 import java.util.Scanner;
 3 public class Main {
 4 
 5     public static void main(String[] args) { 
 6         Scanner in1 = new Scanner(System.in);
 7         BigInteger h[] = new BigInteger[105];
 8         int i,n;
 9         h[0]=BigInteger.ONE;
10         for(i=1;i<=100;i++) {
11             h[i]=h[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));    
12         }
13         while(in1.hasNext()) {
14             n=in1.nextInt();
15             if(n==-1)break;
16             System.out.println(h[n]);
17         }
18     }
19 }