Envío 1265

Código

#include <iostream>

using namespace std;

#define D(x) cout << #x << " " << x << endl

int main() {
	int n, initial = 0, auxFD = 0, auxSD = 0;
	bool isMagic = true;
	cin >> n;
	int m[n][n];
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) cin >> m[i][j];
	}
	for(int i = 0; i < n; ++i) initial += m[0][i];
	for(int i = 0; i < n && isMagic; ++i) {
		int auxR = 0, auxC = 0;
		for(int j = 0; j < n; ++j) {
			auxR += m[i][j];
			auxC += m[j][i];
		}
		isMagic &= (auxR == initial & auxC == initial);
	}
	for(int i = 0; i < n && isMagic; ++i) {
		auxFD += m[i][i];
		auxSD += m[i][n - i - 1];
	}
	isMagic &= (auxFD == initial & auxSD == initial);
	if(isMagic) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}