Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.001 s | 0 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.001 s | 0 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.001 s | 0 KBi |
#11 |
Correcto
|
0.002 s | 0 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.004 s | 1 KBi |
#14 |
Correcto
|
0.002 s | 0 KBi |
#15 |
Correcto
|
0.004 s | 0 KBi |
#16 |
Correcto
|
0.008 s | 1 KBi |
#17 |
Correcto
|
0.006 s | 1 KBi |
#18 |
Correcto
|
0.007 s | 1 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.007 s | 1 KBi |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int arr[n][n]; int firstDiagonal = 0; int secondDiagonal = 0; int sum; int x = n-1; bool isMagic = true; for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { cin>>arr[i][j]; } } for(int i = 0; i < n; i++) { int rowSum = 0; int colSum = 0; firstDiagonal += arr[i][i]; secondDiagonal += arr[i][x]; for(int j = 0; j < n; j++) { rowSum += arr[i][j]; colSum += arr[j][i]; } if(i > 0) { if(!(rowSum == colSum && colSum == sum)) { isMagic = false; break; } } else { if(rowSum == colSum) sum = rowSum; else { isMagic = false; break; } } x--; } if(isMagic) { isMagic = firstDiagonal == secondDiagonal && secondDiagonal == sum; } if(isMagic) cout<<"Yes"<<endl; else cout<<"No"<<endl; return 0; }