Created
October 25, 2015 05:16
-
-
Save giraffesyo/be8d0c4605ce87fc665b to your computer and use it in GitHub Desktop.
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even - valued terms.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
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, ... | |
*/ | |
#include <iostream> | |
using namespace std; | |
int main() | |
{ | |
int numA = 0; | |
int numB = 0; | |
int sum = 1; | |
int evenSum = 0; | |
//By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even - valued terms. | |
while (numA <= 4000000) | |
{ | |
numA = sum; | |
sum = numA + numB; | |
numB = numA; | |
if (sum % 2 == 0) | |
evenSum += sum; | |
} | |
cout << evenSum << endl; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment