欧拉计划2: 偶斐波那契数 Even Fibonacci numbers

• 题目描述
  
  

---

• 结果

#include<iostream>
using namespace std;
//int num[4000005] = {1, 2};
int main() {
    /*
    long long ans = 2;
    for (int i = 2; 1; ++i) {
        num[i] = num[i - 1] + num[i - 2];
        if (num[i] % 2 == 0) {
            ans += num[i];
        }
        if (num[i] > 4000000) {
            break;
        }
    }
    cout << ans << endl;*/
    int a = 1, b = 2, ans = 2;
    while (b <= 4000000) {
        b += a;
        a = b - a;
        if (b %2 == 0) {
            ans += b;
        }
    }
     cout << ans << endl;
    return 0;
}