title: Find Minimum Sum Factors Number
signature: function find_minimum_sum_factors_number(num)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return abs(actual - expected) < 1e-06
  end
  
  function driver(num, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(num), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(83, 83.0);
      @printf("TEST-0...%s\n",result);
      
      result = driver(88, 17.0);
      @printf("TEST-1...%s\n",result);
      
      result = driver(60, 12.0);
      @printf("TEST-2...%s\n",result);
      
      result = driver(6, 5.0);
      @printf("TEST-3...%s\n",result);
      
      result = driver(26, 15.0);
      @printf("TEST-4...%s\n",result);
      
      result = driver(98, 17.0);
      @printf("TEST-5...%s\n",result);
      
      result = driver(38, 21.0);
      @printf("TEST-6...%s\n",result);
      
      result = driver(90, 13.0);
      @printf("TEST-7...%s\n",result);
      
      result = driver(76, 23.0);
      @printf("TEST-8...%s\n",result);
      
      result = driver(66, 16.0);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
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;
  }