HDU 4165 Pills (卡特兰数)

Pills

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1418 Accepted Submission(s): 992

Problem Description
Aunt Lizzie takes half a pill of a certain medicine every day. She starts with a bottle that contains N pills.

On the first day, she removes a random pill, breaks it in two halves, takes one half and puts the other half back into the bottle.

On subsequent days, she removes a random piece (which can be either a whole pill or half a pill) from the bottle. If it is half a pill, she takes it. If it is a whole pill, she takes one half and puts the other half back into the bottle.

In how many ways can she empty the bottle? We represent the sequence of pills removed from the bottle in the course of 2N days as a string, where the i-th character is W if a whole pill was chosen on the i-th day, and H if a half pill was chosen (0 <= i < 2N). How many different valid strings are there that empty the bottle?

Input
The input will contain data for at most 1000 problem instances. For each problem instance there will be one line of input: a positive integer N <= 30, the number of pills initially in the bottle. End of input will be indicated by 0.

Output
For each problem instance, the output will be a single number, displayed at the beginning of a new line. It will be the number of different ways the bottle can be emptied.

Sample Input
6
1
4
2
3
30
0

Sample Output
132
1
14
2
5
3814986502092304

Source
The 2011 Rocky Mountain Regional Contest
有一定数量的药片，每天需要吃半片，如果今天拿到的是半片的那么直接吃，如果拿到的是完整的就切一半，吃掉一半，剩下的放回。
如果要把药吃完，那么这n片要就需要去n次半片，n次整片。令取整片的次数标记为1，取半片的个数为0，从左往右扫描1的个数必须大于等于0的个数。这样就转化为了一个卡特兰数问题。

#include "cstring"
#include "cstdio"
#include "iostream"
#include "string.h"
using namespace std;
//*******************************
//打表卡特兰数
//第 n个 卡特兰数存在a[n]中，a[n][0]表示长度；
//注意数是倒着存的，个位是 a[n][1] 输出时注意倒过来。
//*********************************
int a[105][100];
void ktl()
{
    int i,j,yu,len;
    a[2][0]=1;
    a[2][1]=2;
    a[1][0]=1;
    a[1][1]=1;
    len=1;
    for(i=3;i<101;i++)
    {
        yu=0;
        for(j=1;j<=len;j++)
        {
            int t=(a[i-1][j])*(4*i-2)+yu;
            yu=t/10;
            a[i][j]=t%10;
        }
        while(yu)
        {
            a[i][++len]=yu%10;
            yu/=10;
        }
        for(j=len;j>=1;j--)
        {
            int t=a[i][j]+yu*10;
            a[i][j]=t/(i+1);
            yu = t%(i+1);
        }
        while(!a[i][len])
        {
            len--;
        }
        a[i][0]=len;
    }

}

int main()
{
    ktl();
    int n;
    while(scanf("%d",&n)&&n!=0)
    {
        for(int i=a[n][0];i>0;i--)
            printf("%d",a[n][i]);
        printf("\n");
    }
}