HDU 1023 Train Problem II

Train Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6184    Accepted Submission(s): 3368

Problem Description

As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway.

 

Input

The input contains several test cases. Each test cases consists of a number N(1<=N<=100). The input is terminated by the end of file.

 

Output

For each test case, you should output how many ways that all the trains can get out of the railway.

 

Sample Input

  
  

   
   1
2
3
10
  
  

 

Sample Output

  
  

   
   1
2
5
16796

  
  
  
  


  
  
  
  

   
   套模板就很简单了，知道这题考查的是卡特兰数，计算出卡特兰数即可。不过的先弄懂怎么求卡特兰数，将一个函数接口内的算法搞懂之后，才可以成为模板哦。
  
  
  
  

   
   b[i]存的是第i个卡特兰数的长度，所以内存大小就是卡特兰的数量，并非卡特兰的长度。
  
  
  
  

   
   
#include <iostream>
#include <stdio.h>
using namespace std;
int a[110][1005],b[110];
void catalan(){
    int i, j, len, carry, temp;
    a[1][0] = b[1] = 1;
    len = 1;
    for(i = 2; i <= 100; i++)
    {
        for(j = 0; j < len; j++) //乘法
        a[i][j] = a[i-1][j]*(4*(i-1)+2);
        carry = 0;
        for(j = 0; j < len; j++) //处理相乘结果
        {
            temp = a[i][j] + carry;
            a[i][j] = temp % 10;
            carry = temp / 10;
        }
        while(carry) //进位处理
        {
            a[i][len++] = carry % 10;
            carry /= 10;
        }
        carry = 0;
        for(j = len-1; j >= 0; j--) //除法
        {
            temp = carry*10 + a[i][j];
            a[i][j] = temp/(i+1);
            carry = temp%(i+1);
        }
        while(!a[i][len-1]) //高位零处理
        len --;
        b[i] = len;
    }
}

int main(void)
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
       catalan();
       for(int i=b[n]-1;i>0;i--)
        printf("%d",a[n][i]);
       printf("%d\n",a[n][0]);
    }
    return 0;
}