hdu1134 Game of Connections 卡特兰数(大数)

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?

题解：Catalan数递推公式：

h(n)=h(n-1)*(4*n-2)/(n+1);

#include<cstdlib>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<vector>
#include<algorithm>
#define LL long long
#define maxn 100
#define INF 2147483646
using namespace std;
#define eps 1e-7
#define pi acos(-1.0)
vector<string>catalan;
void convert(string& str)//字符串首尾倒置
{
    int i=0,Size=str.size(),half=Size/2;
    for(;i<half;++i)
        swap(str[i],str[Size-1-i]);
}
string multiply(string &a,int b)
{
    string result;
    int c,carry;
    carry=0;
    for(int i=a.size()-1;i>=0;i--)
    {
        c=(a[i]-'0')*b+carry;
        carry=c/10;
        c%=10;
        result.push_back(c+'0');
    }
    while(carry)
    {
        c = carry%10;
        carry /= 10;
        result.push_back(c+'0');
    }
    convert(result);
    return result;
}
string Divide(const string& a,int b)
{
    string result;
    int carry=0,i,Size=a.size(),c;
    for(i=0;i<Size;++i)
    {
        c = (a[i]-'0')+carry*10;
        carry = c%b;
        c /= b;
        if(c==0&&result.size()==0)continue;
        else result.push_back(c+'0');
    }
    return result;
}
void Cal_catalan()
{
    catalan.push_back("1");
    catalan.push_back("2");
    string num,result;
    int mul,div;
    num='2';
    for(int i=3;i<=maxn;i++)
    {
        mul=i*4-2;
        result=multiply(num,mul);
        div = i+1;//除数
        result = Divide(result,div);
        catalan.push_back(result);
        num = result;
    }
}
int main()
{
    Cal_catalan();
    int n;
    while(cin>>n,~n)
    {
        cout<<catalan[n-1]<<endl;
    }
}