title: Find Sum Even Factors Number
signature: findSumEvenFactorsNumber(n) {
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(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          71, 
          0)
      }");
  
      print("TEST-1...${driver(
          78, 
          112)
      }");
  
      print("TEST-2...${driver(
          39, 
          0)
      }");
  
      print("TEST-3...${driver(
          36, 
          78)
      }");
  
      print("TEST-4...${driver(
          49, 
          0)
      }");
  
      print("TEST-5...${driver(
          17, 
          0)
      }");
  
      print("TEST-6...${driver(
          53, 
          0)
      }");
  
      print("TEST-7...${driver(
          66, 
          96)
      }");
  
      print("TEST-8...${driver(
          92, 
          144)
      }");
  
      print("TEST-9...${driver(
          71, 
          0)
      }");
  
      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;
  }