hdu 1131 卡特兰数，大数

/*
*  create by zzy at 2017,2:03:40 PM
*/

import java.math.BigInteger;
import java.util.Scanner;
public class Main {

static int max=105;
static BigInteger[]h=new BigInteger[max];

static BigInteger[] fact=new BigInteger[max];

public static void getFactorial(){

fact[0]=BigInteger.valueOf(1);
fact[1]=BigInteger.valueOf(1);
for(int i=2;i<max;i++){
// n!= n*(n-1)!
// fact(i) =i*fact(i-1)
fact[i]=BigInteger.valueOf(i).multiply(fact[i-1]);
}

}
public static  void  getCatlanten(){
h[0]=BigInteger.valueOf(1);
h[1]=BigInteger.valueOf(1);

for(int i=2;i<max;i++){

//hn=(4*n-2)/(n+1) *h[n-1]

h[i]=h[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));

}

}

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in=new Scanner(System.in);
int n;

getCatlanten();
getFactorial();
while(in.hasNextInt()){

n=in.nextInt();
if(n==0)break;

System.out.println(h
.multiply(fact
));
}

}

}