title: Sum Factors Number
signature: pub fn sum_factors_number(n: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        76, 
        140
      ));
      
      println!("TEST-1...{}", driver(
        21, 
        32
      ));
      
      println!("TEST-2...{}", driver(
        4, 
        7
      ));
      
      println!("TEST-3...{}", driver(
        49, 
        57
      ));
      
      println!("TEST-4...{}", driver(
        35, 
        48
      ));
      
      println!("TEST-5...{}", driver(
        55, 
        72
      ));
      
      println!("TEST-6...{}", driver(
        43, 
        44
      ));
      
      println!("TEST-7...{}", driver(
        39, 
        56
      ));
      
      println!("TEST-8...{}", driver(
        36, 
        91
      ));
      
      println!("TEST-9...{}", driver(
        5, 
        6
      ));
      
  }
source_py: def sum_factors_number(n):
      result = 0
      for i in range(2, (int(math.sqrt(n)) + 1)):
          if ((n % i) == 0):
              if (i == (n / i)):
                  result = (result + i)
              else:
                  result = (result + (i + (n // i)))
      return ((result + n) + 1)
source_cpp: int sum_factors_number(int n) {
    int result = 0;
    for ( int i = 2;
    i <= sqrt ( n );
    i ++ ) {
      if ( n % i == 0 ) {
        if ( i == ( n / i ) ) result += i;
        else result += ( i + n / i );
      }
    }
    return ( result + n + 1 );
  }