title: Even Fibonacci Numbers Sum
signature: fun evenFibonacciNumbersSum(limit: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(limit: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(limit), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(67, 44)
      println("TEST-0...${result}")
      
      result = driver(89, 44)
      println("TEST-1...${result}")
      
      result = driver(12, 10)
      println("TEST-2...${result}")
      
      result = driver(94, 44)
      println("TEST-3...${result}")
      
      result = driver(96, 44)
      println("TEST-4...${result}")
      
      result = driver(25, 10)
      println("TEST-5...${result}")
      
      result = driver(49, 44)
      println("TEST-6...${result}")
      
      result = driver(8, 10)
      println("TEST-7...${result}")
      
      result = driver(33, 10)
      println("TEST-8...${result}")
      
      result = driver(59, 44)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }