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.
Input
The 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.
Output
For 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 卡特兰公式:另类递归式: h(n)=h(n-1)*(4*n-2)/(n+1); 该递推关系的解为: h(n)=C(2n,n)/(n+1) (n=1,2,3,...)另类递归式: h(n)=h(n-1)*(4*n-2)/(n+1);这一步通过数学知识推一下很好推自己可以推一下方便以后记忆。 该递推关系的解为: h(n)=C(2n,n)/(n+1) (n=1,2,3,...)import java.util.*; import java.math.*; public class Main{ public static void main(String [] args){ BigInteger [] num = new BigInteger[101]; num[0] = BigInteger.valueOf(0); num[1] = BigInteger.valueOf(1); for(int i = 2; i <= 100; i++) num[i] = num[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1)); Scanner in = new Scanner(System.in); int n; while(in.hasNext()){ n = in.nextInt(); System.out.println(num[n]); } } }