title: Sum Matrix Element Absolute Difference Row Column Numbers
signature: fun sumMatrixElementAbsoluteDifferenceRowColumnNumbers(n: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(60, 71980)
      println("TEST-0...${result}")
      
      result = driver(44, 28380)
      println("TEST-1...${result}")
      
      result = driver(72, 124392)
      println("TEST-2...${result}")
      
      result = driver(90, 242970)
      println("TEST-3...${result}")
      
      result = driver(99, 323400)
      println("TEST-4...${result}")
      
      result = driver(45, 30360)
      println("TEST-5...${result}")
      
      result = driver(27, 6552)
      println("TEST-6...${result}")
      
      result = driver(11, 440)
      println("TEST-7...${result}")
      
      result = driver(65, 91520)
      println("TEST-8...${result}")
      
      result = driver(52, 46852)
      println("TEST-9...${result}")
      
          
  }
  
  main()
source_py: def sum_matrix_element_absolute_difference_row_column_numbers(n):
      arr = [[0 for x in range(n)] for y in range(n)]
      for i in range(n):
          for j in range(n):
              arr[i][j] = abs((i - j))
      sum = 0
      for i in range(n):
          for j in range(n):
              sum += arr[i][j]
      return sum
source_cpp: int sum_matrix_element_absolute_difference_row_column_numbers(int n) {
    int arr [ n ] [ n ];
    for ( int i = 0;
    i < n;
    i ++ ) for ( int j = 0;
    j < n;
    j ++ ) arr [ i ] [ j ] = abs ( i - j );
    int sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) for ( int j = 0;
    j < n;
    j ++ ) sum += arr [ i ] [ j ];
    return sum;
  }