地址:https://projecteuler.net/problem=2。
源碼:git@code.aliyun.com:c-program/projecteuler.git。
問題:找到4000000內斐波那契數列中偶數的和。git
#include <stdio.h> #define MAXNUM 4000000 int main(int argc, char **argv){ long long int sum = 0; long long int a = 1; long long int b = 1; long long int c = 0; while ((c = a + b) <= MAXNUM){ a = b; b = c; if (! (c % 2)) sum = sum + c; } printf("Problem2 Answer: %lld\n", sum); }