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): 9930    Accepted Submission(s): 5317

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.

 

 

 

题解：大整数的加法     每一次都一步一步累加上去的话   应该也是可以得    

但是题目不知道要询问多少次   并且n最大也就是100

所以可以先使用大整数加法打表

然后只要输出对应的字符串就可以了

#include<iostream>
#include<string.h>
using namespace std;
char a[111][111][111];
void add(char a[],char b[],char c[])
{
    char t[111],e[111];
    int i=strlen(b)-1,j=strlen(c)-1,k=0;
    while(i>=0&&j>=0)
    {
        t[k]=b[i]+c[j]-'0';
        k++;
        i--;
        j--;
    }
    while(i>=0)
    {
        t[k]=b[i];
        k++;
        i--;
    }
    while(j>=0)
    {
        t[k]=c[j];
        k++;
        j--;
    }
    t[k]='0';
    for(i=0;i<k;i++)
    if(t[i]>'9')
    {
        t[i]=t[i]-10;
        t[i+1]++;
        e[i]=t[i];
    }
    else
    e[i]=t[i];
    if(t[k]=='0')
    e[k]='\0';
    else
    {
        e[k]=t[k];
        e[k+1]='\0';
    }
    for(i=strlen(e)-1,j=0;i>=0;i--,j++)
    a[j]=e[i];
    a[j]='\0';
}
int main()
{
    int i,j,m,n,k,t;
    a[0][0][0]='0';
    a[0][0][1]='\0';
    for(i=1;i<=100;i++)
    {
        a[0][i][0]='1';
        a[0][0][1]='\0';
    }
    for(i=1;i<=100;i++)
    for(j=0;j+i<=100;j++)
    if(j>0)
    add(a[i][j],a[i-1][j+1],a[i][j-1]);
    else
    add(a[i][j],a[i-1][j+1],"0");
    while(cin>>n)
    cout<<a[n][0]<<endl;
}