Envío 4393

Código

#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define sz(x) ((int)x.size())
#define MPI  3.14159265358979323846
#define pb push_back
#define all(x) x.begin(), x.end()

void __print(int x) {cerr << x;}
void __print(ll x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}

void _print() {cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifndef Debug
#define dbg(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif

void solve(){
  int n; cin>>n;
  vector<vector<int>>a(n, vector<int>(n));
  for(int i=0; i<n ;i++){
    for(int j=0; j<n; j++){
      cin>>a[i][j];
    }
  }
  int diagonal1, diagonal2;
  int col, row;
  diagonal1 = diagonal2 = col= row = 0;
  for(int i=0; i<n;i++){
    for(int j=0; j<n; j++){
      if(i==j){
        diagonal1 += a[i][j];
      }
      row+=a[i][j];
      col+=a[j][i];
      diagonal2+= a[n-j-1][i];
    }
  }
  row /= n;
  col /= n;
  diagonal2 /= n;
  if(diagonal1 == diagonal2 && row == col){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
  }
 // cout<<diagonal1<<" "<<diagonal2/n<<" "<<row/n<<" "<<col/n<<endl;;
}

int main(){
  ios::sync_with_stdio(0); cin.tie(0);  cout.tie(0);
  int T=1; 
//  cin>> T;
  while(T--){
    solve();
  }
  return 0;
}