Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 5 KBi |
#2 |
Correcto
|
0.007 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.007 s | 1 KBi |
#5 |
Incorrecto
|
0.007 s | 1 KBi |
#6 |
Incorrecto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.007 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 1 KBi |
#13 |
Correcto
|
0.008 s | 2 KBi |
#14 |
Correcto
|
0.005 s | 2 KBi |
#15 |
Correcto
|
0.005 s | 2 KBi |
#16 |
Correcto
|
0.007 s | 2 KBi |
#17 |
Correcto
|
0.007 s | 2 KBi |
#18 |
Correcto
|
0.008 s | 1 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.005 s | 2 KBi |
#include <bits/stdc++.h> #define endl '\n' using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int nums[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) cin >> nums[i][j]; } bool flag = true; int val = 0; for (int i = 0; i < n; i++) val += nums[i][i]; for (int k = 0; k < 2; k++) { for (int i = 0; i < n; i++) { int acum = 0; if (k == 0) { for (int j = 0; j < n; j++) { acum += nums[i][j]; } } else if (k == 1) { for (int j = 0; j < n; j++) { acum += nums[j][i]; } } if (i != 0 && acum != val) { flag = false; break; } val = acum; } if (!flag) break; } int acum = 0; for (int i = 0; i < n; i++) acum += nums[i][n - i - 1]; if (acum != val) flag = false; if(flag) cout << "Yes" << endl; else cout << "No" << endl; return 0; }