Train Problem II
来源:互联网 发布:rpgmaker python 编辑:程序博客网 时间:2024/05/29 13:22
Train Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9524 Accepted Submission(s): 5104
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
12310
Sample Output
12516796HintThe result will be very large, so you may not process it by 32-bit integers.
import java.util.Scanner;import java.math.BigInteger;public class Main {/** * @param args */public static BigInteger f[]=new BigInteger[101];public static void main(String[] args) {// TODO Auto-generated method stubScanner scan=new Scanner (System.in);f[0]=BigInteger.ONE;for(int i=1;i<101;i++){BigInteger a=BigInteger.valueOf(4*i-2);BigInteger b=BigInteger.valueOf(i+1);f[i]=a.multiply(f[i-1]).divide(b);}while(scan.hasNext()){int n=scan.nextInt();System.out.println(f[n]);}}}
阅读全文
0 0
- Train Problem II
- 1023:Train Problem II
- 1023 Train Problem II
- HDU Train Problem II
- hdu Train Problem II
- hdu1023-Train Problem II
- hdu Train Problem II
- Train Problem II
- Train Problem II
- Train Problem II
- Train Problem II
- HOJ Train Problem II
- hdoj1023 Train Problem II
- Train Problem II
- hdu 1023 Train Problem II
- HDOJ 1023 Train Problem II
- HDOJ 1023 Train Problem II
- HDU-1023 Train Problem II
- 工业触摸屏-嵌入式人机界面HMI7寸 嵌入式工控一体机
- Gym
- Ignatius and the Princess I HDU
- 农具厂农具问题,三重for循环
- 信源编码作业之六:LMS最小均方算法(python)
- Train Problem II
- GIT回顾(持续更新)
- 数据结构中 图概念详解
- 使用线程 Monitor.TryEnter()
- 51Nod 1001 数组中和等于K的数对
- uva 10125
- 32位PowerPC常用指令集总结
- 城市列表
- I