Envío 1283

Código

#include <iostream>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int square[n][n];
	int solveRow[n];
	int solveColunm[n];
	int d1 = 0;
	int d2 = 0;
	for(int i=0;i<n;i++)
	{
		solveRow[i] = 0;
		solveColunm[i] = 0;
	}
	
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			cin >> square[i][j];
			solveRow[i] += square[i][j];
			solveColunm[j] += square[i][j];
			if(i == j)d1 += square[i][j];
			if(i == (n-1-j))d2 += square[i][j];
		}
	}
	
	if(d1 != d2)
	{
		cout <<  "NO";
		return 0;
	}
	
	
	bool rows = true;
	for(int i=0;i<n-1;i++)
	{
		rows = rows && solveRow[i] == solveRow[i+1] && solveColunm[i] == solveColunm[i+1];
		if(!rows)break;
	}
	
	if(!rows)
	{
		cout <<  "NO";
		return 0;
	}
	
	cout <<  "YES";	
	return 0;
	
	
}