# HOJ Train Problem II

103人阅读 评论(0)

Train Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7186 Accepted Submission(s): 3876

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.

Catalan数
Catalan数总结

#include <iostream>
const int MAX = 100 + 10;
const int LEN = MAX - 1;
using namespace std;
int Cat[MAX][MAX];

int initial()
{
int i,j,k;
int temp;
int digit;
int carry;
int multi;
int t;

Cat[0][0] = 1;
Cat[0][LEN] = 1;
for(i = 1; i < MAX; i++)
{
t = i - 1;
multi = 4 * t + 2;
carry = 0;
digit = Cat[i - 1][LEN];
for(j = 0; j < digit; j++)
{
temp = Cat[i - 1][j] * multi + carry;
Cat[i][j] = temp % 10;
carry = temp / 10;
}
while(carry)
{
Cat[i][digit++] = carry % 10;
carry /= 10;
}
t = (i - 1) + 2;
for(j = digit - 1; j >= 0; j--)
{
temp = carry * 10 + Cat[i][j];
Cat[i][j] = temp / t;
carry = temp % t;
}
while(!Cat[i][digit - 1])
digit--;
Cat[i][LEN] = digit;
}

return 0;
}
void print(int k)
{
for(int j = Cat[k][LEN] - 1; j >= 0; j--)
cout << Cat[k][j];
cout << endl;
}
int main()
{
int n;
initial();

while(cin >> n)
print(n);

return 0;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：35389次
• 积分：985
• 等级：
• 排名：千里之外
• 原创：59篇
• 转载：48篇
• 译文：0篇
• 评论：4条
评论排行
最新评论