title: Find Sum Odd Factors Number
signature: def findSumOddFactorsNumber(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        20, 
        6    
      )}")   
  
  
      println(s"TEST-1...${driver(
        6, 
        4    
      )}")   
  
  
      println(s"TEST-2...${driver(
        39, 
        56    
      )}")   
  
  
      println(s"TEST-3...${driver(
        80, 
        6    
      )}")   
  
  
      println(s"TEST-4...${driver(
        88, 
        12    
      )}")   
  
  
      println(s"TEST-5...${driver(
        7, 
        8    
      )}")   
  
  
      println(s"TEST-6...${driver(
        16, 
        1    
      )}")   
  
  
      println(s"TEST-7...${driver(
        27, 
        40    
      )}")   
  
  
      println(s"TEST-8...${driver(
        83, 
        84    
      )}")   
  
  
      println(s"TEST-9...${driver(
        6, 
        4    
      )}")   
  
  }
  
source_py: def find_sum_odd_factors_number(n):
      res = 1
      while ((n % 2) == 0):
          n = (n // 2)
      for i in range(3, int((math.sqrt(n) + 1))):
          count = 0
          curr_sum = 1
          curr_term = 1
          while ((n % i) == 0):
              count += 1
              n = (n // i)
              curr_term *= i
              curr_sum += curr_term
          res *= curr_sum
      if (n >= 2):
          res *= (1 + n)
      return res
source_cpp: int find_sum_odd_factors_number(int n) {
    int res = 1;
    while ( n % 2 == 0 ) n = n / 2;
    for ( int i = 3;
    i <= sqrt ( n );
    i ++ ) {
      int count = 0, curr_sum = 1;
      int curr_term = 1;
      while ( n % i == 0 ) {
        count ++;
        n = n / i;
        curr_term *= i;
        curr_sum += curr_term;
      }
      res *= curr_sum;
    }
    if ( n >= 2 ) res *= ( 1 + n );
    return res;
  }