title: Sum Divisors 1 N 1
signature: function sumDivisors1N1(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(73, 4406);
    console.log(`TEST-0...${result}`);
  
    result = driver(41, 1384);
    console.log(`TEST-1...${result}`);
  
    result = driver(36, 1098);
    console.log(`TEST-2...${result}`);
  
    result = driver(28, 660);
    console.log(`TEST-3...${result}`);
  
    result = driver(49, 1987);
    console.log(`TEST-4...${result}`);
  
    result = driver(24, 491);
    console.log(`TEST-5...${result}`);
  
    result = driver(85, 5977);
    console.log(`TEST-6...${result}`);
  
    result = driver(59, 2846);
    console.log(`TEST-7...${result}`);
  
    result = driver(82, 5561);
    console.log(`TEST-8...${result}`);
  
    result = driver(40, 1342);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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;
  }