斐波那契凤尾

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

重点是在25位后进行补0

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 100000 + 1;
#define MOD 1000000
int f[maxn];

void db(){
    f[1] = 1;
    f[2] = 2;
    for (int i = 3; i < maxn; i++){
        f[i] = f[i - 1] + f[i - 2];
        f[i] %= MOD;
    }
}

int main(){
    int n;
    db();
    while (~scanf("%d",&n)){
        if (n < 25)
            printf("%d
", f[n]);
        else
        printf("%06d
", f[n]);
    }
    //system("pause");
    return 0;
}