A - Train Problem II

As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway. 

InputThe input contains several test cases. Each test cases consists of a number N(1<=N<=100). The input is terminated by the end of file. 
OutputFor each test case, you should output how many ways that all the trains can get out of the railway. 
Sample Input

1
2
3
10

Sample Output

1
2
5
16796


        
 

Hint

The result will be very large, so you may not process it by 32-bit integers.

        卡兰特数 JAVA 好 max！

import java.util.*;
import java.math.*;
public class Main 
{
 public static BigInteger TM;
 public static void main(String[] args)
 {
  Scanner sc=new Scanner(System.in);
  while(sc.hasNext())
  {
   int n=sc.nextInt();
   if(n==-1)
       break;
   int a,b;
   TM=BigInteger.ONE;
   TM=TM.multiply(BigInteger.valueOf(2));
   if(n==1)
   {
       System.out.println(1);
       continue;
   }
   if(n==2)
   {
       System.out.println(2);
       continue;
   }
   for(int i=3;i<=n;i++)
   {
       a=4*i-2;
       b=i+1;
    TM=TM.multiply(BigInteger.valueOf(a));
    TM=TM.divide(BigInteger.valueOf(b));
   
   }
   System.out.println(TM);
  }
 }
}