title: Find Sum Even Factors Number
signature: function findSumEvenFactorsNumber(n: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(n: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(71, 0);
    console.log(`TEST-0...${result}`);
  
    result = driver(78, 112);
    console.log(`TEST-1...${result}`);
  
    result = driver(39, 0);
    console.log(`TEST-2...${result}`);
  
    result = driver(36, 78);
    console.log(`TEST-3...${result}`);
  
    result = driver(49, 0);
    console.log(`TEST-4...${result}`);
  
    result = driver(17, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver(53, 0);
    console.log(`TEST-6...${result}`);
  
    result = driver(66, 96);
    console.log(`TEST-7...${result}`);
  
    result = driver(92, 144);
    console.log(`TEST-8...${result}`);
  
    result = driver(71, 0);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
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;
  }