title: Sum Matrix Element Absolute Difference Row Column Numbers
signature: pub fn sum_matrix_element_absolute_difference_row_column_numbers(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        60, 
        71980
      ));
      
      println!("TEST-1...{}", driver(
        44, 
        28380
      ));
      
      println!("TEST-2...{}", driver(
        72, 
        124392
      ));
      
      println!("TEST-3...{}", driver(
        90, 
        242970
      ));
      
      println!("TEST-4...{}", driver(
        99, 
        323400
      ));
      
      println!("TEST-5...{}", driver(
        45, 
        30360
      ));
      
      println!("TEST-6...{}", driver(
        27, 
        6552
      ));
      
      println!("TEST-7...{}", driver(
        11, 
        440
      ));
      
      println!("TEST-8...{}", driver(
        65, 
        91520
      ));
      
      println!("TEST-9...{}", 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;
  }