title: Find Sum Odd Factors Number
signature: findSumOddFactorsNumber(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(
          20, 
          6)
      }");
  
      print("TEST-1...${driver(
          6, 
          4)
      }");
  
      print("TEST-2...${driver(
          39, 
          56)
      }");
  
      print("TEST-3...${driver(
          80, 
          6)
      }");
  
      print("TEST-4...${driver(
          88, 
          12)
      }");
  
      print("TEST-5...${driver(
          7, 
          8)
      }");
  
      print("TEST-6...${driver(
          16, 
          1)
      }");
  
      print("TEST-7...${driver(
          27, 
          40)
      }");
  
      print("TEST-8...${driver(
          83, 
          84)
      }");
  
      print("TEST-9...${driver(
          6, 
          4)
      }");
  
      return 0;
  }
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;
  }