title: Sum Divisors 1 N 1
signature: pub fn sum_divisors_1_n_1(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(
        73, 
        4406
      ));
      
      println!("TEST-1...{}", driver(
        41, 
        1384
      ));
      
      println!("TEST-2...{}", driver(
        36, 
        1098
      ));
      
      println!("TEST-3...{}", driver(
        28, 
        660
      ));
      
      println!("TEST-4...{}", driver(
        49, 
        1987
      ));
      
      println!("TEST-5...{}", driver(
        24, 
        491
      ));
      
      println!("TEST-6...{}", driver(
        85, 
        5977
      ));
      
      println!("TEST-7...{}", driver(
        59, 
        2846
      ));
      
      println!("TEST-8...{}", driver(
        82, 
        5561
      ));
      
      println!("TEST-9...{}", driver(
        40, 
        1342
      ));
      
  }
source_py: def sum_divisors_1_n_1(n):
      sum = 0
      for i in range(1, (n + 1)):
          sum += (int((n / i)) * i)
      return int(sum)
source_cpp: int sum_divisors_1_n_1(int n) {
    int sum = 0;
    for ( int i = 1;
    i <= n;
    ++ i ) sum += ( n / i ) * i;
    return sum;
  }