hdoj 1297 Children’s Queue 【高精度】【递推】

#include <stdio.h>
#include <string.h>
#define M 1050
int a[M][M];
void table(){
    int i, j;
    memset(a, 0, sizeof(a));
    a[1][0] =1; a[2][0] = 2; a[3][0] = 4; a[4][0] = 7;
    for(i = 5; i < 1050; i ++){
        for(j = 0; j < M; j ++) 
            a[i][j] = a[i-1][j]+a[i-2][j]+a[i-4][j];
        for(j = 0; j < M; j ++){
            if(a[i][j] >= 10){
                int temp = a[i][j]/10;
                a[i][j]%=10;
                a[i][j+1] += temp;
            }
        }
    }
}
int main(){
    table();
    int n, i, j;
    while(scanf("%d", &n) == 1){
        i = M-1;
        while(a
[i] == 0) i --;
        printf("%d", a
[i]);
        while((--i) >= 0) printf("%d", a
[i]);
        puts("");
    }
    return 0;
}