Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.007 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 1 KBi |
#13 |
Correcto
|
0.006 s | 1 KBi |
#14 |
Correcto
|
0.005 s | 1 KBi |
#15 |
Correcto
|
0.006 s | 1 KBi |
#16 |
Correcto
|
0.011 s | 1 KBi |
#17 |
Correcto
|
0.008 s | 1 KBi |
#18 |
Correcto
|
0.009 s | 1 KBi |
#19 |
Correcto
|
0.007 s | 1 KBi |
#20 |
Correcto
|
0.009 s | 1 KBi |
#include <iostream> using namespace std; int main(void) { long length, hr, vr, ld = 0, rd = 0, bf = 0; bool isMagic = true; cin >> length; int arr[length][length]; for (long i = 0; i < length; i++) { for (long j = 0; j < length; j++) cin >> arr[i][j]; } for (long i = 0; i < length; i++) { hr = 0; vr = 0; for (long j = 0; j < length; j++) { hr += arr[i][j]; vr += arr[j][i]; } if (hr != vr || (i > 0 && (hr != bf || vr != bf))) { isMagic = false; break; } if (i == 0) bf = hr; } if (isMagic) { for (long i = 0, j = length - 1; i < length; i++, j--) { ld += arr[i][i]; rd += arr[j][i]; } if (ld != rd) cout << "No" << endl; else cout << "Yes" << endl; } else cout << "No" << endl; return 0; }