title: Find Sum Even Factors Number
signature: int findSumEvenFactorsNumber(int n) {
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 n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), 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(71, 0); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(78, 112); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(39, 0); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 78); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(49, 0); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(17, 0); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(53, 0); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(66, 96); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(92, 144); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 0); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def find_sum_even_factors_number(n):
      if ((n % 2) != 0):
          return 0
      res = 1
      for i in range(2, (int(math.sqrt(n)) + 1)):
          count = 0
          curr_sum = 1
          curr_term = 1
          while ((n % i) == 0):
              count = (count + 1)
              n = (n // i)
              if ((i == 2) and (count == 1)):
                  curr_sum = 0
              curr_term = (curr_term * i)
              curr_sum = (curr_sum + curr_term)
          res = (res * curr_sum)
      if (n >= 2):
          res = (res * (1 + n))
      return res
source_cpp: int find_sum_even_factors_number(int n) {
    if ( n % 2 != 0 ) return 0;
    int res = 1;
    for ( int i = 2;
    i <= sqrt ( n );
    i ++ ) {
      int count = 0, curr_sum = 1, curr_term = 1;
      while ( n % i == 0 ) {
        count ++;
        n = n / i;
        if ( i == 2 && count == 1 ) curr_sum = 0;
        curr_term *= i;
        curr_sum += curr_term;
      }
      res *= curr_sum;
    }
    if ( n >= 2 ) res *= ( 1 + n );
    return res;
  }