Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12649 Accepted Submission(s): 6756 Problem Description 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 Hint The result will be very large, so you may not process it by 32-bit integers.
Author Ignatius.L
Recommend We have carefully selected several similar problems for you: 1133 1022 1130 1131 1134 |
卡特兰数性质:h[n]=h[n-1]*(4n-2)/(n+1)
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner cin = new Scanner(System.in);
BigInteger dp[]=new BigInteger[150];
dp[1]=BigInteger.valueOf(1);
for(int i=2;i<=100;i++)
{
dp[i]=dp[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));
}
while(cin.hasNext())
{
int n=cin.nextInt();
System.out.println(dp[n]);
}
}
}