POJ2084

Written by    12:04 October 10, 2014 

POJ2084

Game of Connections
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 7901 Accepted: 3973

Description

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?

Input

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.

Output

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

Sample Input

Sample Output

Source

这道题就是要在有2*n个点的圆上连线,每个点必须且仅与一个点连线。这样的话每个点只能跟自己相隔偶数个的点相连,然后就可以得出一个递推公式:

f(n) = f(n-1) * f(0)+f(n-2) * f(1)+f(n-3) * f(2)…f(0) * f(n-1)

这就是传说中的卡塔兰数

最后还是照着网上的大数模板敲了一遍,之前一直还没研究过模板的说。

 

 

Category : acmstudy

Tags :