2013
11-27

# Game of Connections

This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, … , 2n – 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some straight line segments to connect them into number pairs. Every number must be connected to exactly one another. And, no two segments are allowed to intersect.It’s still a simple game, isn’t it? But after you’ve written down the 2n numbers, can you tell me in how many different ways can you connect the numbers into pairs? Life is harder, right?

Each line of the input file will be a single positive number n, except the last line, which is a number -1. You may assume that 1 <= n <= 100.

For each n, print in a single line the number of ways to connect the 2n numbers into pairs.

2
3
-1

2
5

1)

an =C(2n,n)/(n+1)=(4n-2)*(an-1 )/(n+1)

package com.njupt.acm;

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

public class HDU_1134 {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

BigInteger one = new BigInteger("1");
BigInteger two = new BigInteger("2");
BigInteger four = new BigInteger("4");

while(scanner.hasNextInt()){
int n = scanner.nextInt();
BigInteger catalan = one;
BigInteger N;
if(n == -1){
break;
}
if( n == 1 ){
System.out.println("1");
continue;
}

for(int i = 1 ; i <= n ; ++i){
N = new BigInteger(String.valueOf(i));