title: Sum Matrix Element Absolute Difference Row Column Numbers
signature: sumMatrixElementAbsoluteDifferenceRowColumnNumbers(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          60, 
          71980)
      }");
  
      print("TEST-1...${driver(
          44, 
          28380)
      }");
  
      print("TEST-2...${driver(
          72, 
          124392)
      }");
  
      print("TEST-3...${driver(
          90, 
          242970)
      }");
  
      print("TEST-4...${driver(
          99, 
          323400)
      }");
  
      print("TEST-5...${driver(
          45, 
          30360)
      }");
  
      print("TEST-6...${driver(
          27, 
          6552)
      }");
  
      print("TEST-7...${driver(
          11, 
          440)
      }");
  
      print("TEST-8...${driver(
          65, 
          91520)
      }");
  
      print("TEST-9...${driver(
          52, 
          46852)
      }");
  
      return 0;
  }
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;
  }