POJ 2084大数+卡特兰数

Game of Connections Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8513 Accepted: 4216

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

2 3 -1

Sample Output

2

5

n最高到100..存不下 只能写个大数的了

#include<stdio.h> #include<string.h> #include<iostream> #define inf 0x3f3f3f3f using namespace std; typedef long long ll; const int base= 10000; const int maxn=200; void mul(int num,int *w) { int c=0; for(int i=maxn;i>=0;i--) { c+=w[i]*num; w[i]=c