Created
July 29, 2020 16:32
-
-
Save DhruvaG2000/591954ebbd572fef2fbab5ad73510ee3 to your computer and use it in GitHub Desktop.
This file contains 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
/* | |
PROBLEM 2: | |
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(){ | |
int previous=1,number=1, former=0; | |
int final = 0; | |
int limit=10; | |
cout << " " << number; | |
while(number<=limit) | |
{ | |
if (number==1) | |
{ | |
number+=previous; | |
previous=1; | |
cout << " " << number; | |
} | |
else | |
{ | |
former=number; | |
number+=previous; | |
previous=former; | |
cout << " " << number; | |
} | |
} | |
cout << "\nEND\n"; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment