title: Even Fibonacci Numbers Sum
signature: func evenFibonacciNumbersSum(limit int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(limit int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(limit),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(67, 44)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(89, 44)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(12, 10)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(94, 44)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(96, 44)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(25, 10)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(49, 44)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(8, 10)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(33, 10)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(59, 44)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }