卡塔兰数介绍

卡塔兰数卡塔兰数维基介绍https://zh.wikipedia.org/wiki/%E5%8D%A1%E5%A1%94%E5%85%B0%E6%95%B0卡塔兰数经典例题

Train Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1106 Accepted Submission(s): 654Problem DescriptionAs 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

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

程序转自 http://blog.csdn.net/abcjennifer/article/details/5307080[/code]