title: Even Fibonacci Numbers Sum
signature: int evenFibonacciNumbersSum(int limit) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int limit, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(limit), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(67, 44); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(89, 44); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(12, 10); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 44); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(96, 44); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(25, 10); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(49, 44); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(8, 10); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(33, 10); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(59, 44); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }