Project Euler - 002

icymirror

Problem 2:
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.

問(wèn)題2:
斐波那契數(shù)列中的每一項(xiàng)都是由它之前兩項(xiàng)求和得到的。當(dāng)以1和2開(kāi)始時(shí)，開(kāi)始10項(xiàng)是：1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ......
現(xiàn)在，把此數(shù)列中的數(shù)值不超過(guò)4000000的項(xiàng)中的偶數(shù)求和，結(jié)果是多少？

代碼：

1. package main
   
2. 
   
3. import (
   
4.         "fmt"
   
5. )
   
6. 
   
7. func Problem002(scope int) int {
   
8.         sum := 0
   
9. 
   
10.         first := 1
    
11.         second := 2
    
12.        
    
13.         for {
    
14.                 if (second > scope) {
    
15.                         break
    
16.                 }
    
17.                
    
18.                 sum = sum + second
    
19. 
    
20.                 first, second = first + second * 2, first * 2 + second * 3
    
21.         }
    
22.        
    
23.         return sum
    
24. }
    
25. 
    
26. func main() {
    
27.         fmt.Println("Problem 002 result: ", Problem002(4000000))
    
28. }

復(fù)制代碼

ba_du_co

拿來(lái)練練手。
4613732

1. #!perl6
   
2. my $n = 4000000;
   
3. say [+] (1, 2, *+* ...^ * > $n).grep: * %% 2

復(fù)制代碼