Envío 6892
- Autor: Aaron Zuñiga
- Fecha: 2023-02-25 07:38:50 UTC (Hace alrededor de 1 mes)
Caso # |
Resultado |
Tiempo |
Memoria |
#1 |

Correcto
|
0.108 s
|
13 KBi |
#2 |

Correcto
|
0.13 s
|
13 KBi |
#3 |

Correcto
|
0.102 s
|
13 KBi |
#4 |

Correcto
|
0.07 s
|
16 KBi |
#5 |

Correcto
|
0.098 s
|
13 KBi |
#6 |

Correcto
|
0.094 s
|
13 KBi |
#7 |

Correcto
|
0.066 s
|
16 KBi |
#8 |

Correcto
|
0.08 s
|
16 KBi |
#9 |

Correcto
|
0.105 s
|
13 KBi |
#10 |

Correcto
|
0.106 s
|
13 KBi |
#11 |

Incorrecto
|
0.108 s
|
13 KBi |
#12 |

Correcto
|
0.07 s
|
16 KBi |
#13 |

Incorrecto
|
0.098 s
|
13 KBi |
#14 |

Correcto
|
0.138 s
|
13 KBi |
#15 |

Correcto
|
0.074 s
|
16 KBi |
#16 |

Correcto
|
0.304 s
|
25 KBi |
#17 |

Correcto
|
0.223 s
|
37 KBi |
#18 |

Correcto
|
0.228 s
|
34 KBi |
#19 |

Correcto
|
0.304 s
|
25 KBi |
#20 |

Correcto
|
0.222 s
|
36 KBi |
Puntos totales: 90 / 100
Código
import java.util.Scanner;
class Main
{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[][] = new int[n][n];
int hor = 0, ver = 0, diag = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
a[i][j] = sc.nextInt();
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
hor = hor + a[i][j];
ver = ver + a[j][i];
}
diag = diag + a[i][i] + a[i][n-i-1];
}
if(hor == ver && hor / n == diag / 2){
System.out.print("Yes");
}else{
System.out.print("No");
}
}
}