title: Sum Divisors 1 N 1
signature: sum_divisors_1_n_1 <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          73L, 
          4406L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          41L, 
          1384L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          36L, 
          1098L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          28L, 
          660L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          49L, 
          1987L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          24L, 
          491L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          85L, 
          5977L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          59L, 
          2846L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          82L, 
          5561L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          40L, 
          1342L
      )))
  
  }
  
  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;
  }