HDU 1715 大菲波数

const int N = 1007;
int f
[217];
int main() {
int i, j;
f[1][0] = f[2][0] = 1;
for(i = 3; i < N; i++) {
for(j = 0; j <= 210; j++)
f[i][j] = f[i-1][j]+f[i-2][j];
int flag = 0;
for(j = 0; j <= 210; j++) {
int tmp = f[i][j] + flag;
flag = tmp/10;
f[i][j] = tmp%10;
}
}
//freopen("data.in", "r", stdin);
int n, pi;
cin >> n;
while(n--) {
cin >> pi;
i = 210;
while(f[pi][i] == 0)
i--;
for(;i >= 0; i--)
printf("%d", f[pi][i]);
printf("\n");
}
return 0;
}