Train Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7539 Accepted Submission(s): 4062
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
2
3
10
Sample Output
1
2
5
16796
2
5
16796
Hint
The result will be very large, so you may not process it by 32-bit integers.
题解：卡特兰数：ｈ( n ) = ( ( 4*n-2 )/( n+1 )*h( n-1 ) );也可以用java，h(n)= h(0)*h(n-1) + h(1)*h(n-2) + 
+ h(n-1)h(0) (其中n>=2);
这里用的大数；
代码：
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<stack>
using namespace std;
const int INF=0x3f3f3f3f;
#define mem(x,y) memset(x,y,sizeof(x))
#define SI(x) scanf("%d",&x)
#define PI(x) printf("%d",x)
int N;
//ｈ( n ) = ( ( 4*n-2 )/( n+1 )*h( n-1 ) );
int ans[][];
void db(){
ans[][]=;
ans[][]=;
ans[][]=;
ans[][]=;
int len=,yu=;
for(int i=;i<=;i++){
for(int j=;j<=len;j++){
int t=ans[i-][j]*(*i-)+yu;
yu=t/;
ans[i][j]=t%;
}
while(yu){
ans[i][++len]=yu%;
yu/=;
}
for(int j=len;j>=;j--){
int t=ans[i][j]+yu*;
ans[i][j]=t/(i+);
yu=t%(i+);
}
while(!ans[i][len])len--;
ans[i][]=len;
}
}
int main(){
mem(ans,);
db();
while(~SI(N)){
for(int i=ans[N][];i>=;i--)printf("%d",ans[N][i]);
puts("");
}
return ;
}