title: Even Fibonacci Numbers Sum
signature: evenFibonacciNumbersSum(limit) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(limit, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(limit), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          67, 
          44)
      }");
  
      print("TEST-1...${driver(
          89, 
          44)
      }");
  
      print("TEST-2...${driver(
          12, 
          10)
      }");
  
      print("TEST-3...${driver(
          94, 
          44)
      }");
  
      print("TEST-4...${driver(
          96, 
          44)
      }");
  
      print("TEST-5...${driver(
          25, 
          10)
      }");
  
      print("TEST-6...${driver(
          49, 
          44)
      }");
  
      print("TEST-7...${driver(
          8, 
          10)
      }");
  
      print("TEST-8...${driver(
          33, 
          10)
      }");
  
      print("TEST-9...${driver(
          59, 
          44)
      }");
  
      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;
  }