title: Sum Divisors 1 N 1
signature: func sumDivisors1N1(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(73, 4406)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(41, 1384)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(36, 1098)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(28, 660)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(49, 1987)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(24, 491)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(85, 5977)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(59, 2846)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(82, 5561)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(40, 1342)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }