1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
|
/** Description of the problem
* 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 <iostream>
#include <conio.h>
#include "C:\Users\Zexd\Desktop\mathfunctions.h"
using std::cout;
using namespace zs;
int main()
{
int sum = 0, a;
for(unsigned long long int i = 0; i <= 4000000; i++)
{
if(!((a = Fibonacci(i)) & 1))
sum += a;
}
cout << sum;
getch();
return 0;
}
|