题目链接:http://acm.tju.edu.cn/toj/showp1179.html
1179.
Game of Connections
Time Limit: 2.0 Seconds
Memory Limit: 65536K
Total Runs: 467
Accepted Runs: 205
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
Source: China 2004 - Shanghai Preliminary
Submit List Runs Forum Statistics
以下就是转载的大数模板:
Catalan数
中文:卡特兰数
原理:
令h(1)=1,h(0)=1,catalan数满足递归式:
h(n)= h(1)*h(n-1) + h(2)*h(n-2) + ... + h(n-1)h(1) (其中n>=2)
另类递归式:
h(n)=((4*n-2)/(n+1))*h(n-1);
该递推关系的解为:
h(n+1)=C(2n,n)/(n+1) (n=1,2,3,...)
我并不关心其解是怎么求出来的,我只想知道怎么用catalan数分析问题。
我总结了一下,最典型的四类应用:(实质上却都一样,无非是递归等式的应用,就看你能不能分解问题写出递归式了)
1.括号化问题。
矩阵链乘: P=a1×a2×a3×……×an,依据乘法结合律,不改变其顺序,只用括号表示成对的乘积,试问有几种括号化的方案?(h(n)种)
2.出栈次序问题。
一个栈(无穷大)的进栈序列为1,2,3,..n,有多少个不同的出栈序列?
类似:有2n个人排成一行进入剧场。入场费5元。其中只有n个人有一张5元钞票,另外n人只有10元钞票,剧院无其它钞票,问有多少中方法使得只要有10元的人买票,售票处就有5元的钞票找零?(将持5元者到达视作将5元入栈,持10元者到达视作使栈中某5元出栈)
3.将多边行划分为三角形问题。
将一个凸多边形区域分成三角形区域的方法数?
类似:一位大城市的律师在她住所以北n个街区和以东n个街区处工作。每天她走2n个街区去上班。如果她
从不穿越(但可以碰到)从家到办公室的对角线,那么有多少条可能的道路?
类似:在圆上选择2n个点,将这些点成对连接起来使得所得到的n条线段不相交的方法数?
4.给顶节点组成二叉树的问题。
给定N个节点,能构成多少种不同的二叉树?
(能构成h(N)个)
- #include<iostream>
- #include<cstring>
- #include<cstdio>
- #include<iomanip>
- #include<algorithm>
- using namespace std;
-
- #define MAXN 9999
- #define MAXSIZE 10
- #define DLEN 4
-
- class BigNum
- {
- private:
- int a[500];
- int len;
- public:
- BigNum(){ len = 1;memset(a,0,sizeof(a)); }
- BigNum(const int);
- BigNum(const char*);
- BigNum(const BigNum &);
- BigNum &operator=(const BigNum &);
-
- friend istream& operator>>(istream&, BigNum&);
- friend ostream& operator<<(ostream&, BigNum&);
-
- BigNum operator+(const BigNum &) const;
- BigNum operator-(const BigNum &) const;
- BigNum operator*(const BigNum &) const;
- BigNum operator/(const int &) const;
-
- BigNum operator^(const int &) const;
- int operator%(const int &) const;
- bool operator>(const BigNum & T)const;
- bool operator>(const int & t)const;
-
- void print();
- };
- BigNum::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::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(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::BigNum(const BigNum & T) : len(T.len)
- {
- int i;
- memset(a,0,sizeof(a));
- for(i = 0 ; i < len ; i++)
- a[i] = T.a[i];
- }
- BigNum & BigNum::operator=(const BigNum & n)
- {
- int i;
- len = n.len;
- memset(a,0,sizeof(a));
- for(i = 0 ; i < len ; i++)
- a[i] = n.a[i];
- return *this;
- }
- istream& operator>>(istream & in, BigNum & b)
- {
- char ch[MAXSIZE*4];
- int i = -1;
- in>>ch;
- int l=strlen(ch);
- int count=0,sum=0;
- for(i=l-1;i>=0;)
- {
- sum = 0;
- int t=1;
- for(int j=0;j<4&&i>=0;j++,i--,t*=10)
- {
- sum+=(ch[i]-'0')*t;
- }
- b.a[count]=sum;
- count++;
- }
- b.len =count++;
- return in;
-
- }
- ostream& operator<<(ostream& out, BigNum& b)
- {
- int i;
- cout << b.a[b.len - 1];
- for(i = b.len - 2 ; i >= 0 ; i--)
- {
- cout.width(DLEN);
- cout.fill('0');
- cout << b.a[i];
- }
- return out;
- }
-
- BigNum BigNum::operator+(const BigNum & T) const
- {
- BigNum t(*this);
- int i,big;
- big = T.len > len ? T.len : len;
- for(i = 0 ; i < big ; i++)
- {
- t.a[i] +=T.a[i];
- if(t.a[i] > MAXN)
- {
- t.a[i + 1]++;
- t.a[i] -=MAXN+1;
- }
- }
- if(t.a[big] != 0)
- t.len = big + 1;
- else
- t.len = big;
- return t;
- }
- BigNum BigNum::operator-(const BigNum & T) const
- {
- int i,j,big;
- 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 ; i < big ; i++)
- {
- if(t1.a[i] < t2.a[i])
- {
- j = i + 1;
- while(t1.a[j] == 0)
- j++;
- t1.a[j--]--;
- while(j > i)
- t1.a[j--] += MAXN;
- t1.a[i] += MAXN + 1 - t2.a[i];
- }
- else
- t1.a[i] -= t2.a[i];
- }
- t1.len = big;
- while(t1.a[len - 1] == 0 && t1.len > 1)
- {
- t1.len--;
- big--;
- }
- if(flag)
- t1.a[big-1]=0-t1.a[big-1];
- return t1;
- }
-
- BigNum BigNum::operator*(const BigNum & T) const
- {
- BigNum ret;
- int i,j,up;
- int temp,temp1;
- for(i = 0 ; i < len ; i++)
- {
- up = 0;
- for(j = 0 ; j < T.len ; j++)
- {
- temp = a[i] * T.a[j] + ret.a[i + j] + up;
- if(temp > MAXN)
- {
- 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 != 0)
- ret.a[i + j] = up;
- }
- ret.len = i + j;
- while(ret.a[ret.len - 1] == 0 && ret.len > 1)
- ret.len--;
- return ret;
- }
- BigNum BigNum::operator/(const int & b) const
- {
- BigNum ret;
- int i,down = 0;
- for(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] == 0 && ret.len > 1)
- ret.len--;
- return ret;
- }
- int BigNum::operator %(const int & b) const
- {
- int i,d=0;
- for (i = len-1; i>=0; i--)
- {
- d = ((d * (MAXN+1))% b + a[i])% b;
- }
- return d;
- }
- BigNum BigNum::operator^(const int & n) const
- {
- BigNum t,ret(1);
- 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 BigNum::operator>(const BigNum & T) const
- {
- int ln;
- if(len > T.len)
- return true;
- else if(len == T.len)
- {
- ln = len - 1;
- while(a[ln] == T.a[ln] && ln >= 0)
- ln--;
- if(ln >= 0 && a[ln] > T.a[ln])
- return true;
- else
- return false;
- }
- else
- return false;
- }
- bool BigNum::operator >(const int & t) const
- {
- BigNum b(t);
- return *this>b;
- }
-
- void BigNum::print()
- {
- int i;
- cout << a[len - 1];
- for(i = len - 2 ; i >= 0 ; i--)
- {
- cout.width(DLEN);
- cout.fill('0');
- cout << a[i];
- }
- cout << endl;
- }
- int main(void)
- {
- int i,n;
- BigNum x[101];
- x[0]=1;
- for(i=1;i<101;i++)
- x[i]=x[i-1]*(4*i-2)/(i+1);
- while(scanf("%d",&n)==1 && n!=-1)
- {
- x[n].print();
- }
- }
Java版
-
-
-
-
-
-
-
-
- import java.util.*;
- import java.math.*;
- public class Main{
- public static void main(String[] args)
- {
- int n;
- Scanner in=new Scanner(System.in);
- BigInteger one=BigInteger.ONE;
- BigInteger four=new BigInteger("4");
- BigInteger two=new BigInteger("2");
- BigInteger st=null;
- BigInteger t=null;
- while(in.hasNextInt())
- {
- n=in.nextInt();
- if(n==-1)break;
- t=BigInteger.ONE;
- for(int i=2;i<=n;i++)
- {
- st=new BigInteger(""+i);
-
- t=t.multiply(st.multiply(four).subtract(two)).divide(st.add(one));
- }
- System.out.println(t);
- }
- }
- }