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 30 31 32
|
//////////////////////////////////////////////////////////////////////
//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>
using namespace std;
int main()
{
/* COUNTER, FIRST, SECOND, NEXT NUM, SUM*/
int c, first = 0, second = 1, next, sum;
/*CREATE FOR LOOP FOR FIBONACCI SEQUENCE*/
for (c = 0; next < 4000000; c++) {
next = first + second;
first = second;
second = next;
cout << next << endl;
if (next%2 == 0)
next += sum;
}
cout << endl << "The sum is: " << sum << endl;
}
/* ANSWER IS: 4613732 */
|