title: Sum Matrix Element Element Integer Division Row Column
signature: sumMatrixElementElementIntegerDivisionRowColumn(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, 
          7021)
      }");
  
      print("TEST-1...${driver(
          74, 
          11190)
      }");
  
      print("TEST-2...${driver(
          8, 
          77)
      }");
  
      print("TEST-3...${driver(
          74, 
          11190)
      }");
  
      print("TEST-4...${driver(
          34, 
          1974)
      }");
  
      print("TEST-5...${driver(
          66, 
          8680)
      }");
  
      print("TEST-6...${driver(
          96, 
          19920)
      }");
  
      print("TEST-7...${driver(
          11, 
          156)
      }");
  
      print("TEST-8...${driver(
          45, 
          3697)
      }");
  
      print("TEST-9...${driver(
          72, 
          10530)
      }");
  
      return 0;
  }
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;
  }