title: Find Minimum Sum Factors Number
signature: float findMinimumSumFactorsNumber(int num) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(float actual, float expected){
      return abs(actual - expected) < 1e-06;
  }
  
  string driver(int num, float expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(83, 83.0); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(88, 17.0); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(60, 12.0); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(6, 5.0); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(26, 15.0); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(98, 17.0); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(38, 21.0); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(90, 13.0); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(76, 23.0); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(66, 16.0); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }