POJ2084卡特兰数+高精度模板

GameofConnectionsTimeLimit:1000MS MemoryLimit:30000KTotalSubmissions:7 Game of ConnectionsTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7136Accepted: 3625

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

23-1

Sample Output

25

Source

我是巩固一下卡特兰数，顺便存一下高精度模板的。

代码：

/* ***********************************************Author :rabbitCreated Time :2014/3/27 13:57:20File Name :7.cpp************************************************ */#pragma comment(linker, "/STACK:102400000,102400000")#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x3f3f3f3f#define eps 1e-8#define pi acos(-1.0)typedef long long ll;const int maxn=9999;const int maxsize=2020;const int dlen=4;class BigNum{private:int a[1000],len;public:BigNum(){len=1;memset(a,0,sizeof(a));}BigNum(const int b){int c,d=b;len=0;memset(a,0,sizeof(a));while(d>maxn){c=d-(d/(maxn+1))*(maxn+1);d=d/(maxn+1);a[len++]=c;}a[len++]=d;}BigNum(const char *s){int t,k,index,L,i;memset(a,0,sizeof(a));L=strlen(s);len=L/dlen;if(L%dlen)len++;index=0;for(int i=L-1;i>=0;i-=dlen){t=0;k=i-dlen+1;if(k<0)k=0;for(int j=k;j<=i;j++)t=t*10+s[j]-‘0‘;a[index++]=t;}}BigNum(const BigNum memset(a,0,sizeof(a));for(int i=0;ilen?T.len:len;for(int i=0;imaxn){t.a[i+1]++;t.a[i]-=maxn+1;}}if(t.a[big])t.len=big+1;else t.len=big;return t;}BigNum operator - (const BigNum bool flag;BigNum t1,t2;if(*this>T){t1=*this;t2=T;flag=0;}else{t1=T;t2=*this;flag=1;}big=t1.len;for(i=0;ii)t1.a[j--]+=maxn;t1.a[i]+=maxn+1-t1.a[i];}else t1.a[i]-=t2.a[i];}t1.len=big;while(t1.a[len-1]==0big--;}if(flag)t1.a[big-1]=0-t1.a[big-1];return t1;}BigNum operator * (const BigNum int i,j,up;int temp,temp1;for( i=0;imaxn){temp1=temp-temp/(maxn+1)*(maxn+1);up=temp/(maxn+1);ret.a[i+j]=temp1;}else{up=0;ret.a[i+j]=temp;}}if(up)ret.a[i+j]=up;}ret.len=i+j;while(ret.a[ret.len-1]==0return ret;}BigNum operator / (const int int i,down=0;for(int i=len-1;i>=0;i--){ret.a[i]=(a[i]+down*(maxn+1))/b;down=a[i]+down*(maxn+1)-ret.a[i]*b;}ret.len=len;while(ret.a[ret.len-1]==0return ret;}BigNum operator % (const int for(int i=len-1;i>=0;i--)d=((d*(maxn+1))%b+a[i])%b;return d;}BigNum operator ^ (const int int i;if(n<0)exit(-1);if(n==0)return 1;if(n==1)return *this;int m=n;while(m>1){t=*this;for( i=1;(i<<1)<=m;i<<=1)t=t*t;m-=i;ret=ret*t;if(m==1)ret=ret*(*this);}return ret;}bool operator > (const BigNum if(len>T.len)return true;else if(len==T.len){ln=len-1;while(a[ln]==T.a[ln]if(ln>=0else return false;}else return false;}bool operator > (const int return *this>b;}void print(){int i;printf("%d",a[len-1]);for(int i=len-2;i>=0;i--)printf("%04d",a[i]);puts("");}};int main(){ //freopen("data.in","r",stdin); //freopen("data.out","w",stdout); BigNum f[110]; f[0]=BigNum(1); //f[0].print(); for(int i=1;i<=100;i++) f[i]=f[i-1]*BigNum(4*i-2)/(i+1); int n; while(cin>>n return 0;}

POJ 2084 卡特兰数+高精度模板,布布扣,bubuko.com