title: Even Fibonacci Numbers Sum
signature: pub fn even_fibonacci_numbers_sum(limit: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(limit: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(limit), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        67, 
        44
      ));
      
      println!("TEST-1...{}", driver(
        89, 
        44
      ));
      
      println!("TEST-2...{}", driver(
        12, 
        10
      ));
      
      println!("TEST-3...{}", driver(
        94, 
        44
      ));
      
      println!("TEST-4...{}", driver(
        96, 
        44
      ));
      
      println!("TEST-5...{}", driver(
        25, 
        10
      ));
      
      println!("TEST-6...{}", driver(
        49, 
        44
      ));
      
      println!("TEST-7...{}", driver(
        8, 
        10
      ));
      
      println!("TEST-8...{}", driver(
        33, 
        10
      ));
      
      println!("TEST-9...{}", driver(
        59, 
        44
      ));
      
  }
source_py: def even_fibonacci_numbers_sum(limit):
      if (limit < 2):
          return 0
      ef1 = 0
      ef2 = 2
      sm = (ef1 + ef2)
      while (ef2 <= limit):
          ef3 = ((4 * ef2) + ef1)
          if (ef3 > limit):
              break
          ef1 = ef2
          ef2 = ef3
          sm = (sm + ef2)
      return sm
source_cpp: int even_fibonacci_numbers_sum(int limit) {
    if ( limit < 2 ) return 0;
    long long int ef1 = 0, ef2 = 2;
    long long int sum = ef1 + ef2;
    while ( ef2 <= limit ) {
      long long int ef3 = 4 * ef2 + ef1;
      if ( ef3 > limit ) break;
      ef1 = ef2;
      ef2 = ef3;
      sum += ef2;
    }
    return sum;
  }