Project Euler | Problem 2

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,…

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

---

/******************************  Program 1  ***********************************
* 思路：
*	1. a(n - 2) + a(n - 1) = a(n)
*	2. 利用三个变量分别盛放以上变化的三个相邻项，以形成斐波那契额数列的一部分
*	3. 检测符合要求的项并求和
* 收获：
*	1.1. 斐波那契额数列：Fibonacci numbers
*	1.2. 偶数：even-valued
*	1.3. 时间钟：clock()
* 评价：
*	优点：
*		1. 只记录变化的相邻三项
*	缺点：
*		1. 需要逐一生成数列各项
*****************************************************************************/

#define _CRT_SECURE_NO_WARNINGS
#define MAX_FIBONACCI_NUMBER 4000000
#define FIRST_TERM           1
#define THE_SECOND_TERM      2

#include <stdio.h>
#include <time.h>

/*-------------------------------------------------------------------------*/

int main()
{
	time_t start, finish;
	start = clock();// 收获1.3

	//初始化
	int term1st = FIRST_TERM;
	int term2nd = THE_SECOND_TERM;
	int term3rd = term1st + term2nd;
	int sum = 0;

	//检测已知的前两项并检测求和
	if (!(term1st % 2))
		sum += term1st;
	if (!(term2nd % 2))
		sum += term2nd;

	//生成新项并检测求和
	while (term3rd < MAX_FIBONACCI_NUMBER)
	{
		if (!(term3rd % 2))
			sum += term3rd;
		term1st = term2nd;
		term2nd = term3rd;
		term3rd = term1st + term2nd;
	}
	printf("%d\n", sum);

	//计时模块
	finish = clock();
	double duration = (double)(finish - start);
	printf("程序计算耗时:%lf秒\n.", duration);

	return 0;
}