HDU 1023 Train Problem II (卡特兰数)
发布时间：2021-03-15 06:28:41 所属栏目：大数据 来源：网络整理
导读：Train Problem II Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7876????Accepted Submission(s): 4223 Problem Description As we all know the Train Problem I,the boss of the Ignatiu
|
Train Problem IITime Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7876????Accepted Submission(s): 4223 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.
等我 （编辑：源码网） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |
