█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 3616

Problema 0xe1 - Cuadrado mágico

  • Autor: jocarmp08
  • Fecha: 2021-04-04 01:45:44 UTC (Hace alrededor de 3 años)
Caso # Resultado Tiempo Memoria
#1
Correcto
0.021 s 3 KBi
#2
Correcto
0.028 s 5 KBi
#3
Correcto
0.025 s 3 KBi
#4
Correcto
0.025 s 3 KBi
#5
Correcto
0.022 s 3 KBi
#6
Correcto
0.024 s 3 KBi
#7
Correcto
0.016 s 3 KBi
#8
Correcto
0.028 s 4 KBi
#9
Correcto
0.029 s 4 KBi
#10
Correcto
0.023 s 3 KBi
#11
Correcto
0.03 s 3 KBi
#12
Correcto
0.021 s 3 KBi
#13
Correcto
0.029 s 3 KBi
#14
Correcto
0.021 s 3 KBi
#15
Correcto
0.029 s 4 KBi
#16
Correcto
0.027 s 3 KBi
#17
Correcto
0.023 s 3 KBi
#18
Correcto
0.019 s 3 KBi
#19
Correcto
0.034 s 3 KBi
#20
Correcto
0.019 s 3 KBi
Puntos totales: 100 / 100

Código

def magic_square(square, n):
    # Check diagonals
    primary_diagonal = 0
    secondary_diagonal = 0
    for i in range(n):
        primary_diagonal += square[i][i]
        secondary_diagonal += square[i][n - i - 1]

    if primary_diagonal != secondary_diagonal:
        print("No")
        return

    # Check rows
    for i in range(n):
        if primary_diagonal != sum(square[i]):
            print("No")
            return

    # Check columns
    for i in range(n):
        col_sum = 0
        for j in range(n):
            col_sum += square[j][i]
        if col_sum != primary_diagonal:
            print("No")
            return

    print("Yes")


n = int(input())
square = [[int(x) for x in input().split()] for _ in range(n)]
magic_square(square, n)