title: Find Sum Even Factors Number
signature: find_sum_even_factors_number <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          71L, 
          0L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          78L, 
          112L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          39L, 
          0L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          36L, 
          78L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          49L, 
          0L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          17L, 
          0L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          53L, 
          0L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          66L, 
          96L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          92L, 
          144L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          71L, 
          0L
      )))
  
  }
  
  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;
  }