How Many Trees? UVA - 10303（卡特兰数、大数）

题目链接：How Many Trees? UVA - 10303

Catalan数列：

c[0]=c[1]=1。

递推关系：

   c[n]=c[0]*c[n-1]+c[1]*c[n-2]+…+c[n-1]*c[0]  (n>=2)

   c[n]=c[n-1]*(4*n-2)/(n+1)

应用：

1、 n个左括号和n个右括号组成的合法括号序列的数量为c[n]

2、 1，2，……，n经过一个栈，形成的合法出栈序列的数量为c[n]

3、 n个节点构成的不同二叉树的数量为c[n]

4、 在平面直角坐标系中，每一步只能向上或向右走，从（0，0）走到（n，n）并且除两个端点外不接触直线y=x的路线数量为2*c[n-1]

通项公式：

          c[n]=C(2n,n)/(n+1)

从第零项开始：
1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452, …

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int N=1e3+5;

struct bign
{
    int len;
    int s[N];

    bign()
    {
        len=1;
        memset(s,0,sizeof(s));
    }

    bign operator = (const char *number)
    {
        len=strlen(number);
        for(int i=0;i<len;i++)
            s[len-i-1]=number[i]-'0';

        return *this;
    }
    bign operator = (const int number)
    {
        char string[N];
        sprintf(string,"%d",number);
        *this=string;
        return *this;
    }

    bign (int number) {*this=number;}
    bign (const char *number) {*this=number;}

    bign operator + (const bign &c)
    {
        bign sum;
        int t=0;
        sum.len=max(this->len,c.len);

        for(int i=0;i<sum.len;i++)
        {
            if(i<this->len)
                t+=this->s[i];
            if(i<c.len)
                t+=c.s[i];

            sum.s[i]=t%10;
            t/=10;
        }

        while(t)
            sum.s[sum.len++]=t%10,t/=10;

        return sum;
    }
    bign operator * (const bign &c)
    {
        bign sum,zero;
        if(*this==zero||c==zero)
            return zero;

        sum.len=this->len+c.len;
        for(int i=0;i<this->len;i++)
            for(int j=0;j<c.len;j++)
                sum.s[i+j]+=this->s[i]*c.s[j];
        for(int i=0;i<sum.len;i++)
            sum.s[i+1]+=sum.s[i]/10,sum.s[i]%=10;
        sum.len++;

        while(!sum.s[sum.len-1])
            sum.len--;

        return sum;
    }
    bign operator * (const int &num)
    {
        bign c=num;
        return *this*c;
    }
    bign operator / (const int &num)
    {
        bign ans;
        int k=0;

        ans.len=len;
        for(int i=ans.len-1;i>=0;i--)
        {
            ans.s[i]=(k*10+s[i])/num;
            k=(k*10+s[i])%num;
        }

        while(!ans.s[ans.len-1])
            ans.len--;

        return ans;
    }
    bign operator - (const bign &c)
    {
        bign ans;
        ans.len=max(this->len,c.len);

        int i;
        for(i=0;i<c.len;i++)
        {
            if(this->s[i]<c.s[i])
            {
                this->s[i]+=10;
                this->s[i+1]--;
            }
            ans.s[i]=this->s[i]-c.s[i];
        }
        for(;i<this->len;i++)
        {
            if(this->s[i]<0)
            {
                this->s[i]+=10;
                this->s[i+1]--;
            }
            ans.s[i]=this->s[i];
        }

        while(ans.s[ans.len-1]==0)
            ans.len--;
        if(ans.len==0)
            ans.len=1;

        return ans;
    }

    void put()
    {
        if(len==1&&s[0]==0)
            printf("0");
        else
            for(int i=len-1;i>=0;i--)
                printf("%d",s[i]);
        printf("\n");
    }

    bool operator < (const bign &b) const
    {
        if(len!=b.len)
            return len<b.len;

        for(int i=len-1;i>=0;i--)
            if(s[i]!=b.s[i])
                return s[i]<b.s[i];

        return false;
    }
    bool operator > (const bign &b) const {return b<*this;}
    bool operator <= (const bign &b) const {return !(b<*this);}
    bool operator >= (const bign &b) const {return !(*this<b);}
    bool operator != (const bign &b) const {return b<*this||*this<b;}
    bool operator == (const bign &b) const {return !(b!=*this);}
};

bign c[N+5];

void setc()
{
    c[1]=1;
    for(int i=2;i<=N;i++)
        c[i]=c[i-1]*(4*i-2)/(i+1);
}

int main()
{
    setc();

    int n;
    while(~scanf("%d",&n))
        c[n].put();

    return 0;
}