title: Find Sum Odd Factors Number
signature: fun findSumOddFactorsNumber(n: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(20, 6)
      println("TEST-0...${result}")
      
      result = driver(6, 4)
      println("TEST-1...${result}")
      
      result = driver(39, 56)
      println("TEST-2...${result}")
      
      result = driver(80, 6)
      println("TEST-3...${result}")
      
      result = driver(88, 12)
      println("TEST-4...${result}")
      
      result = driver(7, 8)
      println("TEST-5...${result}")
      
      result = driver(16, 1)
      println("TEST-6...${result}")
      
      result = driver(27, 40)
      println("TEST-7...${result}")
      
      result = driver(83, 84)
      println("TEST-8...${result}")
      
      result = driver(6, 4)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }