Even Fibonacci numbers

题目链接：https://projecteuler.net/problem=2

题目描述：

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

题目大意：求斐波那契数列值中不超过大于四百万的偶数和

代码实现如下：

#include <cstdio>

const int maxn=4000000;
long long sum=0;
long long fi[100];

void biao(){  //打表
    fi[0]=fi[1]=1;
    for(int i=2;fi[i-1]<=maxn;i++){
        fi[i]=fi[i-1]+fi[i-2];
    }
}

int main(){
    biao();
    for(int i=1;fi[i]<=maxn;i++){
        if(fi[i]<=maxn && fi[i]%2==0){
            sum+=fi[i];
        }
    }
    printf("%lld\n",sum);
}

看我博客的老铁们如果有其他的解题方法还请在评论区告诉我，谢谢啦~