Problem 2 : Even Fibonacci numbers

Problem 2

---

Even Fibonacci numbers

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.

---

偶斐波那契数

斐波那契数列中的每一项都是前两项的和。由1和2开始生成的斐波那契数列前10项为：

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

考虑该斐波那契数列中不超过四百万的项，求其中为偶数的项之和。

题目解答

    朴素解法：暴力枚举（遍历所有斐波那契额数，判断到偶数时加到计数器中即可）

      优化算法：我们先将所有斐波那契额数列出

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

    我们发现每个偶数之前的下标距离是相同的，斐波那契额数列递归式如下：

                

       既然一个数字与前两个数字相关，前两个数字又和各自的前两个数字相关，那么我们可以推断出一个数字一定和之前出现过的数字相关，我们可以推导出以下等式：

 

                      

题目代码   

#include <stdio.h>
#include <inttypes.h>
#define N 4e6
int32_t main() {
    int32_t num[3] = {0};
    num[0] = 2;
    num[1] = 8;
    int64_t sum = 10;
    for (int i = 2; ; i++){
        num[i % 3] = num[(i + 1) % 3] + 4 * num[(i+2) % 3];
        if(num[i % 3] > N)
            break;
        sum += num[i % 3];
    }
    printf("%" PRId64 "\n", sum);
    return 0;
}