寒假翻译题训练 2月16号

链接：https://acs.jxnu.edu.cn/problem/HDU1023

题目：

描述：

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.

翻译如下

描述：

依据火车问题I，Ignatius火车站的老板想要知道如果所有的火车都按照严格递增的顺序进站，那么火车有多少种方案开出铁路。

输入：

输入包含多组样例。每组样例包含一个数字N(1<=N<=100)，输入直到文件末尾终止。

输出：

对于每组样例，输出火车开出铁路的方案数。