hdu1023(大数相乘与大数相除)
2015-02-02 15:10
411 查看
Train Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6295 Accepted Submission(s): 3417
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数。大数与小数的相乘和相除(hdu1134)
- NYOJ 45 棋盘覆盖(大数相乘,相除)
- hdu 1023 1130 1134 卡特兰数 (中间有大数相除和大数相乘)
- 大数相除 /大数相乘 大数相除是低精度
- 高精度模版(大数相加 相乘 相除)
- hdu 1023 Train Problem II 这题运用到大数相乘+大数相除+卡特兰数
- 大数对整数的相除、取模、相乘运算
- 大数相乘
- 大数相乘
- 大数相乘
- 历届试题 矩阵翻硬币 蓝桥杯 大数开方 大数相乘
- 【编程题m_0018】大数相乘 3ff8
- 大数运算(三)——大数相除求余数和商
- zoj3903 大数相乘
- 大数相乘
- 两个大数相乘的C++实现
- java大数相乘
- 算法--大数相乘
- 大数相乘
- 编程训练大数相乘