Project Euler Problem2

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.

Solution:-

#include <bits/stdc++.h>
using namespace std;

int main() {

long long int a = 1;
long long int b = 2;
long long int c = 2;

long long int sum = 0;

while(c < 4000000)
{
if(c%2 == 0)
{
cout << c <<"\t";
sum+=c;
}

c = a + b;
a = b;
b = c;
}

cout<<"\nTotal Sum:- " << sum;
return 0;
}