title: Sum Divisors 1 N 1
signature: int sumDivisors1N1(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(73, 4406); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(41, 1384); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 1098); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(28, 660); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(49, 1987); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(24, 491); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(85, 5977); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(59, 2846); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(82, 5561); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(40, 1342); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }