欧拉项目第2题.

 

 

 找不到好的方法,只好这样先完成了

public class Task_2 { public static void main(String args[]){ int sum=2; int a1,a2,a3=0; a1 = 1; a2 = 2; while(a3<4000000){ a3 = a1+a2; a1 = a2; a2 = a3; if(0==a3%2) sum+=a3; } System.out.print(sum); } }

 

看了看别人写的代码,还有不少人根据数列的规律优化了下.

规律大致是这样的

Fibonacci 数列 为(x=y=1)

 

x,y,x+y,x+2y,2x+3y,3x+5y...

红色的是偶数.

这样代码就可以写成下面

 

def calcE(): x = y = 1 sum = 0 while (sum < 1000000): sum += (x + y) x, y = x + 2 * y, 2 * x + 3 * y return sum

 

 

还有一个叫olegyk 的家伙写的

J:

fib=: {."1@(]`(({: , +/)@])@.(> {:)^:(<_))&1 2

+/ (#~ -.@(2&|)) fib 1e6
这是啥没看明白.哈哈~~

 

 

附上题目:

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.