卡塔兰数介绍
来源:互联网 发布:踢脚线墙暖的危害 知乎 编辑:程序博客网 时间:2024/06/06 02:41
卡塔兰数
卡塔兰数维基介绍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): 654
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
12310
Sample Output
12516796
The result will be very large, so you may not process it by 32-bit integers.HintHint
程序转自 http://blog.csdn.net/abcjennifer/article/details/5307080
0 0