title: Find Minimum Sum Factors Number
signature: findMinimumSumFactorsNumber(num) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(double actual, double expected){
      return (actual - expected).abs() < 1e-06;
  }
  
  String driver(num, double expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(num), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          83, 
          83.0)
      }");
  
      print("TEST-1...${driver(
          88, 
          17.0)
      }");
  
      print("TEST-2...${driver(
          60, 
          12.0)
      }");
  
      print("TEST-3...${driver(
          6, 
          5.0)
      }");
  
      print("TEST-4...${driver(
          26, 
          15.0)
      }");
  
      print("TEST-5...${driver(
          98, 
          17.0)
      }");
  
      print("TEST-6...${driver(
          38, 
          21.0)
      }");
  
      print("TEST-7...${driver(
          90, 
          13.0)
      }");
  
      print("TEST-8...${driver(
          76, 
          23.0)
      }");
  
      print("TEST-9...${driver(
          66, 
          16.0)
      }");
  
      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;
  }