Envío 5972
Problema 0xe1 - Cuadrado mágico
- Autor: d3l4t0rr3
- Fecha: 2022-04-04 14:51:53 UTC (Hace alrededor de 2 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Incorrecto
|
0.01 s | 3 KBi |
| #2 |
Incorrecto
|
0.026 s | 4 KBi |
| #3 |
Incorrecto
|
0.008 s | 3 KBi |
| #4 |
Correcto
|
0.011 s | 3 KBi |
| #5 |
Correcto
|
0.013 s | 3 KBi |
| #6 |
Correcto
|
0.013 s | 3 KBi |
| #7 |
Correcto
|
0.01 s | 3 KBi |
| #8 |
Correcto
|
0.027 s | 3 KBi |
| #9 |
Correcto
|
0.011 s | 3 KBi |
| #10 |
Correcto
|
0.016 s | 3 KBi |
| #11 |
Correcto
|
0.009 s | 3 KBi |
| #12 |
Incorrecto
|
0.01 s | 3 KBi |
| #13 |
Correcto
|
0.01 s | 3 KBi |
| #14 |
Incorrecto
|
0.01 s | 3 KBi |
| #15 |
Incorrecto
|
0.011 s | 3 KBi |
| #16 |
Incorrecto
|
0.033 s | 3 KBi |
| #17 |
Correcto
|
0.01 s | 3 KBi |
| #18 |
Incorrecto
|
0.028 s | 3 KBi |
| #19 |
Incorrecto
|
0.01 s | 3 KBi |
| #20 |
Correcto
|
0.01 s | 3 KBi |
Puntos totales: 55 / 100
Código
n = int(input())
m = []
while (n):
p = input()
f = [int(x) for x in p.split()]
m.append(f)
n -= 1
suma = 0
for i in range(len(m)):
for j in range(len(m)):
suma += m[i][j]
if suma != sum(m[0]):
print("No")
else:
print("Yes")