title: Sum Divisors 1 N 1
signature: function sum_divisors_1_n_1(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(73, 4406);
      @printf("TEST-0...%s\n",result);
      
      result = driver(41, 1384);
      @printf("TEST-1...%s\n",result);
      
      result = driver(36, 1098);
      @printf("TEST-2...%s\n",result);
      
      result = driver(28, 660);
      @printf("TEST-3...%s\n",result);
      
      result = driver(49, 1987);
      @printf("TEST-4...%s\n",result);
      
      result = driver(24, 491);
      @printf("TEST-5...%s\n",result);
      
      result = driver(85, 5977);
      @printf("TEST-6...%s\n",result);
      
      result = driver(59, 2846);
      @printf("TEST-7...%s\n",result);
      
      result = driver(82, 5561);
      @printf("TEST-8...%s\n",result);
      
      result = driver(40, 1342);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }