title: Sum Matrix Element Element Integer Division Row Column
signature: def sumMatrixElementElementIntegerDivisionRowColumn(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        60, 
        7021    
      )}")   
  
  
      println(s"TEST-1...${driver(
        74, 
        11190    
      )}")   
  
  
      println(s"TEST-2...${driver(
        8, 
        77    
      )}")   
  
  
      println(s"TEST-3...${driver(
        74, 
        11190    
      )}")   
  
  
      println(s"TEST-4...${driver(
        34, 
        1974    
      )}")   
  
  
      println(s"TEST-5...${driver(
        66, 
        8680    
      )}")   
  
  
      println(s"TEST-6...${driver(
        96, 
        19920    
      )}")   
  
  
      println(s"TEST-7...${driver(
        11, 
        156    
      )}")   
  
  
      println(s"TEST-8...${driver(
        45, 
        3697    
      )}")   
  
  
      println(s"TEST-9...${driver(
        72, 
        10530    
      )}")   
  
  }
  
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;
  }