Envío 5486

Código

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<n;i++)
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define lli long long int
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
ostream& operator<<(ostream& os, const vector<int> &v){
    for(auto const &i: v){
        os<<i<<" ";
    }
    os<<endl;
    return os;
}
const lli mod=(1e9)+7;
const int N = 1e4+1;
int main(){
    fast_io;
    int n;cin>>n;
    int m[n][n];
    REP(i,n){
        REP(j,n){
            cin>>m[i][j];
        }
    }
    vi ans;
    int a1 = 0; int a2 = 0;
    REP(i,n){
        //diags
        a1 += m[i][i];
        a2 += m[n-1-i][i];
        int a3 = 0;
        int a4 = 0;
        REP(j,n){
            a3 += m[i][j];
        }
        REP(j,n){
            a4 += m[j][i];
        }
        ans.pb(a3);
        ans.pb(a4);
    }
    ans.pb(a1);
    ans.pb(a2);
    int prev = ans[0];
    bool flag = true;
    REP(i,ans.size()){
        //cout<<ans[i]<<endl;
        if(ans[i]!=prev)flag = false;
    }
    if(flag)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}