【ACM Steps】2.2.6 HDOJ 1023 Train Problem II JAVA解决卡特兰大数问题

</pre><p></p><h1 style="line-height:1.5em; margin:0px 0px 0.5em; padding:0px; color:rgb(26,92,200); font-family:Helvetica,Tahoma,Arial,sans-serif; text-align:center">Train Problem II</h1><p></p><p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px; font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px; text-align:center"><strong><span style="font-family:Arial; color:rgb(0,128,0); font-size:12px">Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2111    Accepted Submission(s): 1238</span></strong></p><div class="panel_title" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">Problem Description</div><div class="panel_content" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">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.</div><p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px; font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px"> </p><div class="panel_title" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">Input</div><div class="panel_content" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">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.</div><p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px; font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px"> </p><div class="panel_title" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">Output</div><div class="panel_content" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">For each test case, you should output how many ways that all the trains can get out of the railway.</div><p style="margin-top:0px; margin-bottom:0px; padding-top:0px; padding-bottom:0px; font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px"> </p><div class="panel_title" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px">Sample Input</div><div class="panel_content" style="font-family:Helvetica,Tahoma,Arial,sans-serif; font-size:14px; line-height:25.200000762939453px"><pre style="font-size:1em"><div style="font-family:'Courier New',Courier,monospace">1
2
3
10</div>

 

Sample Output

  
  

   
   1
2
5
16796
  
  

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BigInteger[] k = new BigInteger[105];
		k[0] = BigInteger.ZERO;
		k[1] = BigInteger.valueOf(1);
		for (int i = 2; i <= 100; i++) {
			k[i] = k[i-1].multiply(BigInteger.valueOf(4 * i - 2)).divide(BigInteger.valueOf(i + 1));
		}
		Scanner scanner = new Scanner(System.in);
		int n;
		while (scanner.hasNext()) {
			n = scanner.nextInt();
			System.out.println(k[n]);
		}
	}
}

用java来写高精度，简单了很多