Problem 2--(c)

Problem 2

19 October 2001

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, ...

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

Answer:	4613732

code:
#include
int main(void)
{
int f1=1,f2=2,sum=0,t;
while(f2<4000000)
{
if(f2%2==0)
sum+=f2;
t=f1;
f1=f2;
f2=f2+t;
}
printf("%d\n",sum);
return 0;
}