ProjectEuler Problem-2 Solution

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.

Solution :

#include<iostream>
using namespace std;
#include<conio.h>

int main()
{
 int a=0,b=1,c;
 int rg;
 unsigned long int sum=0;
 c=a+b;
 while(c<4000000)
 { 
      if(c%2==0)
      sum=sum+c;
      a=b;
      b=c;  
   c=a+b;   
 }
 cout<<endl<<"Sum of even-valued terms  :"<<sum;
 return 0;
}