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.
斐波那契数列,找出不超过4百万的所有偶数项的累加和。
1 #include <stdio.h> 2 main() 3 { 4 int i=1,j=2,sum=0; 5 while(i<4000000 && j<4000000) 6 { 7 if(j%2==0) sum+=j; 8 i=i+j; 9 if(i%2==0) sum+=i; 10 j=i+j; 11 } 12 printf("sum=%d",sum); 13 }