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.
int main()
{
for (int i=1,j=1,n=0; i < 4000000 && j < 4000000;)
{
i+=j;
if (i%2==0)
{
n+=i;
}
j+=i;
if (j%2==0)
{
n+=j;
}
}
printf("%d\n",n);
return 0;
}