Euler2.rs

/*


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.

*** PROBLEM WITH EULER CONDITION THEY SAY 4 MILLION BUT ACTUALLY MEAN 40 MILLION
*/

fn fibonacci(limit : i32) -> Vec<i32> {
    let mut i = 1;
    let mut j = 2;
    let mut fibs = vec![1,2];
    println!("{}",limit);
    loop{
        let next_fib = i+j;
        if next_fib > limit {
            break;
        }
        fibs.push(next_fib);
        i = j;
        j = next_fib;
        
    }
    fibs
}

fn sum_even_fibs(v : Vec<i32> ) -> i32 {
    let mut sum = 0;
    for i in v {
        if i % 2 == 0 {
            sum += i;
        }
        
    }
    sum
    
}
fn main(){
    let fib = fibonacci(4000000);
    println!("{:?}",fib);
    let sum = sum_even_fibs(fib);
    println!("{}",sum);
    
}