题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1023

Train Problem II

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

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.

Author

Ignatius.L

Recommend

We have carefully selected several similar problems for you: 1133 1022 1130 1131 1134

题目大意：问你有n辆火车，要求进站顺序是1-n 问你有多少种出站次序

思路：要用到大数，所以推荐用java来写，方便很多。这题就是一个卡特兰数的板子

看代码：

import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.Scanner;public class Main {public static void main(String args[]) {Scanner cin = new Scanner(System.in);/** 卡特兰数性质:h[n]=h[n-1]*(4n-2)/(n+1)*/BigInteger dp[] = new BigInteger[150];dp[1]=BigInteger.valueOf(1);for(int i=2;i<=100;i++) {dp[i]=dp[i-1].multiply(BigInteger.valueOf(4*i-2)).divide(BigInteger.valueOf(i+1));}while(cin.hasNext()) {int n=cin.nextInt();System.out.println(dp[n]);}}
}

转载于:https://www.cnblogs.com/caijiaming/p/10724785.html

Train Problem II（卡特兰数组合数学）相关推荐

hdu1032 Train Problem II (卡特兰数)
题意: 给你一个数n,表示有n辆火车,编号从1到n,入站,问你有多少种出站的可能. (题于文末) 知识点: ps:百度百科的卡特兰数讲的不错,注意看其参考的博客. 卡特兰数(Catalan):前 ...
Train Problem II 卡特兰裸题（入门题）
Train Problem II 题目大意:给你一个数n,表示有n辆火车,编号从1到n,从远方驶过来,问你有多少种出站的可能. 解题思路:模拟栈的问题而已. 卡特兰问题. 1 import jav ...
hdu 1023 Train Problem II
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1212 Train Problem II Description As we all know the ...
HDU1023 Train Problem II
传送门https://vjudge.net/problem/HDU-1023 解题思路: 大数和卡特兰数实现代码: #include <iostream> #include <cs ...
HDU1023 Train Problem II【Catalan数】
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1023 题目大意: 一列N节的火车以严格的顺序到一个站里.问出来的时候有多少种顺序. 解题思路: 典型 ...
【HDOJ】1023 Train Problem II_天涯浪子_新浪博客
[题目]http://acm.hdu.edu.cn/showproblem.php?pid=1023 [报告] 简单粗暴的卡特兰数,不过要用大数才能过呦~ [程序] // Task: 1023 Tra ...
《组合数学》——卡特兰数
我们结合一个题目具体看看Catalan数的应用.(Pr0blem source:hdu2067) Problem Description 小兔的叔叔从外面旅游回来给她带来了一个礼物,小兔高兴地跑回自己 ...
【组合数学】卡特兰数 / 大施罗德数相关
在组合数学中,施罗德数用来描述从 (0,0)(0, 0)(0,0) 到 (n,n)(n,n)(n,n) 的网格中,只能使用 (1,0)(1,0)(1,0).(0,1)(0,1)(0,1).(1,1)( ...
Nowcoder 5477E. 弦（卡特兰数、组合数学）
题目描述: 给定一个圆,圆上有2N个互不重叠的点.每次操作随机选择两个先前未选择过的点连一条弦,共连成N条弦,求所有弦不交的概率. 输入描述: 一行,只有一个整数N(1≤N≤10^7). 输出描述: ...

Train Problem II（卡特兰数组合数学）

Train Problem II

Train Problem II（卡特兰数组合数学）相关推荐

最新文章

热门文章

Train Problem II（卡特兰数 组合数学）

Train Problem II

Train Problem II（卡特兰数 组合数学）相关推荐

最新文章

热门文章

Train Problem II（卡特兰数组合数学）

Train Problem II（卡特兰数组合数学）相关推荐