title: Sum Matrix Element Absolute Difference Row Column Numbers
signature: sumMatrixElementAbsoluteDifferenceRowColumnNumbers :: Integer -> Integer
  sumMatrixElementAbsoluteDifferenceRowColumnNumbers n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (60) (71980) )
  
      printf "TEST-1...%s\n" (driver (44) (28380) )
  
      printf "TEST-2...%s\n" (driver (72) (124392) )
  
      printf "TEST-3...%s\n" (driver (90) (242970) )
  
      printf "TEST-4...%s\n" (driver (99) (323400) )
  
      printf "TEST-5...%s\n" (driver (45) (30360) )
  
      printf "TEST-6...%s\n" (driver (27) (6552) )
  
      printf "TEST-7...%s\n" (driver (11) (440) )
  
      printf "TEST-8...%s\n" (driver (65) (91520) )
  
      printf "TEST-9...%s\n" (driver (52) (46852) )
  
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;
  }