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 Problem2() {
long fib_array[3];
fib_array[0] = 1;
fib_array[1] = 2;
long total = 2;
while(true) {
fib_array[2] = fib_array[0] + fib_array[1];
fib_array[0] = fib_array[1];
fib_array[1] = fib_array[2];
if(fib_array[2] >= 4000000)
break;
if(fib_array[2] % 2 == 0)
total += fib_array[2];
}
return total;
}

### Like this:

Like Loading...

*Related*