title: Sum Matrix Element Element Integer Division Row Column
signature: func sumMatrixElementElementIntegerDivisionRowColumn(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(60, 7021)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(74, 11190)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(8, 77)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(74, 11190)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(34, 1974)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(66, 8680)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(96, 19920)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(11, 156)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(45, 3697)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(72, 10530)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def sum_matrix_element_element_integer_division_row_column(N):
      ans = 0
      for i in range(1, (N + 1)):
          for j in range(1, (N + 1)):
              ans += (i // j)
      return ans
source_cpp: int sum_matrix_element_element_integer_division_row_column(int n) {
    int ans = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) for ( int j = 1;
    j <= n;
    j ++ ) ans += ( i / j );
    return ans;
  }