hdu1297

递推题，但是数据范围太大，用大数相加，但是时间太长了。。890MS。。

f(n) = f(n-1)+f(n-2)+f(n-4);

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define N 1001
char stre[1001][1001];
char ch3[1001];
void sum(char ch1[],char ch2[])
{
    int num[N],i,j ;
    int m,n,k,t,s;
    m = strlen(ch1);
    n = strlen(ch2);
    k = m<n?n:m;
    s=k;
    for(i=0;i<=k;i++) num[i]=0;
    for(i=m-1,j=n-1;i>=0&&j>=0;i--,j--)
    {
        t=(ch1[i]-'0')+(ch2[j]-'0');
        num[s--] = t;
    }
    while(i>=0)
    {
        num[s--] = ch1[i--]-'0';
    }
    while(j>=0)
    {
        num[s--] = ch2[j--]-'0';
    }

    for(i=k;i>=1;i--)
    {
        if(num[i]>9)
        {
            num[i] -= 10;
            num[i-1] += 1; 
        }
    }
    if(num[0]==0)
    {
        ch3[k] = '\0';
        for(i=1;i<=k;i++) ch3[i-1] = (char)(num[i]+'0');
    }
    else
    {
        ch3[k+1] = '\0';
        for(i=0;i<=k;i++) ch3[i] = (char)(num[i]+'0');
    }
    return ;
}

void work(int n)
{
    int i;
    char tmp[1001];
    strcpy(stre[1],"1");strcpy(stre[2],"2");
    strcpy(stre[3],"4");strcpy(stre[4],"7");
    for(i=5;i<=n;i++)
    {
        sum(stre[i-1],stre[i-2]);
        strcpy(tmp,ch3);
        sum(tmp,stre[i-4]);
        strcpy(tmp,ch3);
        strcpy(stre[i],tmp);
    }
    puts(stre[n]);
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        work(n);
    }
    return 0;
}