Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 6 KBi |
#3 |
Correcto
|
0.007 s | 2 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.007 s | 7 KBi |
#6 |
Correcto
|
0.006 s | 5 KBi |
#7 |
Correcto
|
0.006 s | 11 KBi |
#8 |
Correcto
|
0.005 s | 5 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.005 s | 7 KBi |
#11 |
Correcto
|
0.004 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 2 KBi |
#15 |
Correcto
|
0.005 s | 2 KBi |
#16 |
Correcto
|
0.009 s | 1 KBi |
#17 |
Correcto
|
0.007 s | 2 KBi |
#18 |
Correcto
|
0.007 s | 1 KBi |
#19 |
Correcto
|
0.005 s | 1 KBi |
#20 |
Correcto
|
0.006 s | 1 KBi |
// #include <bits/stdc++.h> using namespace std; #define INF 1000000000 #define MOD 1000000007 #define PI 3.14159265 #define EPS 1e-9 #define Pi acos(-1.0) typedef pair<int, int> ii; typedef long long ll; typedef vector<ll> vll; typedef pair<ll,ll> pll; #define forr(i,a,b) for(int i=(a); i<(b); i++) #define clean(arr,val) memset(arr,val,sizeof(arr)) #define forn(i,n) forr(i,0,n) #define PB push_back typedef vector<int> vi; typedef vector<ii> vii; typedef vector<pll> vpll; /*CODE START HERE*/ int n, sum, aux; int m[105][105]; bool sol; int main(){ ios::sync_with_stdio(0); sol = true; cin >> n; forn(i,n){ forn(j,n){ cin >> m[i][j]; } } sum = 0; forn(i,n){ sum += m[i][0]; } forn(i,n){ aux = 0; //Filas forn(j,n){ aux += m[i][j]; } if(aux != sum) sol = false; //Col aux = 0; forn(j,n){ aux += m[j][i]; } if(aux != sum) sol = false; } //Diag aux = 0; forn(i,n){ aux += m[i][i]; } if(aux != sum) sol = false; aux = 0; forn(i,n){ aux += m[n-i-1][i]; } if(aux != sum){ sol = false; } if(sol){ cout << "Yes\n"; }else{ cout << "No\n"; } return 0; }