星际密码

题目：https://www.nowcoder.com/pat/2/problem/254

#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
const int maxn = 105;
int f[10005];
int x[maxn];

void db(){
    int a, b, c, d;
    int a1, b1, c1, d1;
    a = b = c = 1;
    d = 0;
    f[0] = 1;
    f[1] = 1;
    for (int i = 2; i < 10005; i++){
        f[i] = (f[i - 1] + f[i - 2]) % 10000;
    }

}

int main(){
//    std::ios::sync_with_stdio(false);
    int n;
    db();
    while (~scanf("%d",&n))
    {
        for (int i = 0; i < n; i++){
            scanf("%d", &x[i]);
        }
        for (int i = 0; i < n; i++){
            printf("%04d", f[x[i]]);
        }
        printf("
");
    }
    //system("pause");
    return 0;
}