title: Find Minimum Sum Factors Number
signature: pub fn find_minimum_sum_factors_number(num: i32) -> f32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: f32, expected: f32)->bool{
  return (actual - expected).abs() < 1e-06
  }
  pub fn driver(num: i32, expected: f32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(num), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        83, 
        83.0
      ));
      
      println!("TEST-1...{}", driver(
        88, 
        17.0
      ));
      
      println!("TEST-2...{}", driver(
        60, 
        12.0
      ));
      
      println!("TEST-3...{}", driver(
        6, 
        5.0
      ));
      
      println!("TEST-4...{}", driver(
        26, 
        15.0
      ));
      
      println!("TEST-5...{}", driver(
        98, 
        17.0
      ));
      
      println!("TEST-6...{}", driver(
        38, 
        21.0
      ));
      
      println!("TEST-7...{}", driver(
        90, 
        13.0
      ));
      
      println!("TEST-8...{}", driver(
        76, 
        23.0
      ));
      
      println!("TEST-9...{}", driver(
        66, 
        16.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;
  }