HDU 1023 Train Problem II(Catalan)

Train Problem II

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

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


   
   

    
    

     
     Hint
    
    
The result will be very large, so you may not process it by 32-bit integers.

   
   
   
   


   
   
   
   

    
    
#include <stdio.h>
#include <string.h> 
#include <stdlib.h> 
#include <math.h>
#include <iostream>
using  namespace  std;      
     
const  int MAXL = 100+1;      
struct  BigNum      
{      
BigNum(){
  memset(num,0,sizeof(num));
}
    int  num[MAXL];      
    int  len;      
};      
//高精度乘以低精度，当b很大时可能会发生溢出int范围,具体情况具体分析      
//如果b很大可以考虑把b看成高精度      
BigNum Mul1(BigNum &a, int b)      
{      
    BigNum c;      
    int  i, len;      
    len = a.len;      
    
    //乘以0，直接返回0      
    if(b == 0)       
    {      
        c.len = 1;      
        return  c;      
    }      
    for(i = 0; i < len; i++)      
    {      
        c.num[i] += (a.num[i]*b);      
        if(c.num[i] >= 10)      
        {      
            c.num[i+1] = c.num[i]/10;      
            c.num[i] %= 10;      
        }      
    }      
    while(c.num[len] > 0)      
    {      
        c.num[len+1] = c.num[len]/10;      
        c.num[len++] %= 10;      
    }      
    c.len = len;       
    return  c;      
}      
//高精度除以低精度,除的结果为c, 余数为f      
void Div1(BigNum &a, int b, BigNum &c)      
{      
    int  i, len = a.len;      
    memset(c.num, 0, sizeof(c.num));      
    int f = 0;      
    for(i = a.len-1; i >= 0; i--)      
    {      
        f = f*10+a.num[i];      
        c.num[i] = f/b;      
        f %= b;      
    }      
    while(len > 1 && c.num[len-1] == 0)
		len--;      
    c.len = len;      
}      
void  print(BigNum &a)   //输出大数   
{      
    int  i;      
    for(i = a.len-1; i >= 0; i--)      
        printf("%d", a.num[i]);            
}      
void Init(BigNum &a, char *s)   //将字符串转化为大数
{   
    int  i = 0, j = strlen(s); 
    a.len = j;
    for(; s[i] != '\0'; i++, j--)
        a.num[j-1] = s[i]-'0';
}   
  
int main(void)      
{      
    BigNum a[MAXL],tmp;   
    int i,n,yushu;
	Init(a[0],"1");
    for(i=1;i<MAXL;i++){
    	tmp=Mul1(a[i-1],4*i-2);
    	Div1(tmp,i+1,a[i]);
	}
    while(cin>>n)   
    {       
        print(a[n]);   
        cout<<endl;  
    }   
    return 0;   
}