当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1023：Train Problem II

题目描述
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.
输入解释
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.
输出解释
For each test case, you should output how many ways that all the trains can get out of the railway.
输入样例 
1
2
3
10
输出样例 
1
2
5
16796
提示
The result will be very large, so you may not process it by 32-bit integers.
来自杭电HDUOJ的附加信息
Author Ignatius.L
Recommend
该题目是Virtual Judge题目，来自 杭电HDUOJ
源链接： HDU-1023
最后修改于 2020-10-25T22:41:28+00:00 由爬虫自动更新
共提交 670 次
通过率 52.09%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)