title: Find Minimum Sum Factors Number
signature: def findMinimumSumFactorsNumber(num: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Float , expected: Float): Boolean = {
      (actual - expected).abs < 1e-06F
  }
  
  def driver(num: Int, expected: Float): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(num),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        83, 
        83.0F    
      )}")   
  
  
      println(s"TEST-1...${driver(
        88, 
        17.0F    
      )}")   
  
  
      println(s"TEST-2...${driver(
        60, 
        12.0F    
      )}")   
  
  
      println(s"TEST-3...${driver(
        6, 
        5.0F    
      )}")   
  
  
      println(s"TEST-4...${driver(
        26, 
        15.0F    
      )}")   
  
  
      println(s"TEST-5...${driver(
        98, 
        17.0F    
      )}")   
  
  
      println(s"TEST-6...${driver(
        38, 
        21.0F    
      )}")   
  
  
      println(s"TEST-7...${driver(
        90, 
        13.0F    
      )}")   
  
  
      println(s"TEST-8...${driver(
        76, 
        23.0F    
      )}")   
  
  
      println(s"TEST-9...${driver(
        66, 
        16.0F    
      )}")   
  
  }
  
source_py: def find_minimum_sum_factors_number(num):
      sum = 0
      i = 2
      while ((i * i) <= num):
          while ((num % i) == 0):
              sum += i
              num /= i
          i += 1
      sum += num
      return sum
source_cpp: int find_minimum_sum_factors_number(int num) {
    int sum = 0;
    for ( int i = 2;
    i * i <= num;
    i ++ ) {
      while ( num % i == 0 ) {
        sum += i;
        num /= i;
      }
    }
    sum += num;
    return sum;
  }