title: Sum Matrix Element Element Integer Division Row Column 1
signature: int sumMatrixElementElementIntegerDivisionRowColumn1(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(35, 630); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(93, 4371); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(7, 28); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 3321); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(80, 3240); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(47, 1128); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(7, 28); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(41, 861); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(59, 1770); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(34, 595); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def sum_matrix_element_element_integer_division_row_column_1(n):
      ans = 0
      temp = 0
      for i in range(1, (n + 1)):
          if (temp < n):
              temp = (i - 1)
              num = 1
              while (temp < n):
                  if ((temp + i) <= n):
                      ans += (i * num)
                  else:
                      ans += ((n - temp) * num)
                  temp += i
                  num += 1
      return ans
source_cpp: int sum_matrix_element_element_integer_division_row_column_1(int n) {
    int ans = 0, temp = 0, num;
    for ( int i = 1;
    i <= n && temp < n;
    i ++ ) {
      temp = i - 1;
      num = 1;
      while ( temp < n ) {
        if ( temp + i <= n ) ans += ( i * num );
        else ans += ( ( n - temp ) * num );
        temp += i;
        num ++;
      }
    }
    return ans;
  }