杭电ACM OJ 1023 Train Problem II 卡特兰数 + 大数乘法轻松解决出栈情况计数

最新推荐文章于 2019-08-14 12:20:04 发布

徐乙

最新推荐文章于 2019-08-14 12:20:04 发布

阅读量467

点赞数

分类专栏：算法题文章标签：杭电ACM OJ 1023 Train Problem I 卡特兰数大数乘法

本文链接：https://blog.csdn.net/qq_36523667/article/details/78589802

版权

博客详细介绍了如何运用卡特兰数和大数乘法来解决杭电ACM在线评测系统中的1023题——Train Problem II。通过这两种数学方法，可以有效计算出特定出栈情况的计数。

摘要由CSDN通过智能技术生成

Train Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10121 Accepted Submission(s): 5407

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

Sample Output

  
  
  
   
   
   1
2
5
16796

  
  
  
  
  
  

  
  
  
  
  
  

  
  
  
  
  
  
   
   
   翻译：和上一题一样，这一次不要求算具体的出栈要求下对应的情况，只要求算有几辆车有几种出栈情况。
  
  
  
  
  
  
   
   
   比如
  
  
  
  
  
  
   
   
   1，1
  
  
  
  
  
  
   
   
   2,2
  
  
  
  
  
  
   
   
   3,5
  
  
  
  
  
  
   
   
   。。。
  
  
  
  
  
  

  
  
  
  
  
  
   
   
   思路：了解卡特兰数 和 大数乘法。
  
  
  
  
  
  
   
   
   大数乘法可以看我的http://blog.csdn.net/qq_36523667/article/details/78587835,最简单
  
  
  
  
  
  
   
   
   卡特蓝数直接