Envío 1311

Código

#include <iostream>
#include <vector>

using namespace std;

int main()
{
   int n;
   cin >> n;
   long m[n][n];
   for (int i = 0; i < n; i++)
   {
      for (int j = 0; j < n; j++)
      {
         cin >> m[i][j];
      }
   }

   //initialize counters
   int rows[n];
   int cols[n];
   int diagonal = 0, transverse = 0;
   for (int i = 0; i < n; i++)
   {
      rows[i] = 0;
      cols[i] = 0;
   }

   for (int r = 0; r < n; r++)
   {
      diagonal += m[r][r];
      transverse += m[r][n-1-r];
      for (int c = 0; c < n; c++)
      {
         int cell = m[r][c];
         rows[r] = rows[r] + cell;
         cols[c] = cols[c] + cell;
      }
   }
   
   // validate
   bool isMagic = diagonal == transverse;
   for (int i = 0; isMagic and i < n; i++)
   {
      isMagic = diagonal == rows[i] and diagonal == cols[i];
   }
   
   if (isMagic)
   {
      cout << "Yes";
   }
   else 
   {
      cout << "No";
   }
   cout << endl;
   

   return 0;
}