Problem 2523 --Train Problem II

2523: Train Problem II

上一题 正确率: $75.00\%$ 下一题
"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $4$ 正确数量 $3$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 数学

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

提示

The result will be very large, so you may not process it by 32-bit integers.

推荐代码 查看2523 所有题解 上传题解视频得图灵币

本题记录 用 户（点击查看用户） 运行号（点击购买题解） 时 间
算法最快[$84 $ms] AOJ大管家 201425 2018-02-03 14:12:36
内存最少[$11100 $KB] AOJ大管家 201425 2018-02-03 14:12:36
第一AC 计爱玲 201424 2018-02-03 14:11:13
第一挑战 计爱玲 201424 2018-02-03 14:11:13

赛题来源/所属竞赛 NA N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛