Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.024 s | 3 KBi |
#2 |
Correcto
|
0.027 s | 3 KBi |
#3 |
Correcto
|
0.023 s | 3 KBi |
#4 |
Correcto
|
0.022 s | 3 KBi |
#5 |
Correcto
|
0.024 s | 3 KBi |
#6 |
Correcto
|
0.025 s | 3 KBi |
#7 |
Correcto
|
0.023 s | 3 KBi |
#8 |
Correcto
|
0.023 s | 3 KBi |
#9 |
Correcto
|
0.023 s | 3 KBi |
#10 |
Correcto
|
0.026 s | 3 KBi |
#11 |
Correcto
|
0.025 s | 3 KBi |
#12 |
Correcto
|
0.023 s | 3 KBi |
#13 |
Correcto
|
0.023 s | 3 KBi |
#14 |
Correcto
|
0.026 s | 3 KBi |
#15 |
Correcto
|
0.026 s | 3 KBi |
#16 |
Correcto
|
0.027 s | 3 KBi |
#17 |
Correcto
|
0.026 s | 3 KBi |
#18 |
Correcto
|
0.034 s | 3 KBi |
#19 |
Correcto
|
0.029 s | 3 KBi |
#20 |
Correcto
|
0.028 s | 3 KBi |
def solve(matrix): want = sum(matrix[0]) for row in matrix: if sum(row) != want: return False for c in range(n): col = [matrix[r][c] for r in range(n)] if sum(col) != want: return False diagonal1 = [matrix[i][i] for i in range(n)] diagonal2 = [matrix[i][n-1-i] for i in range(n)] if sum(diagonal1) != want or sum(diagonal2) != want: return False return True if __name__ == "__main__": n = int(input()) matrix = [] for _ in range(n): # O(n^2) matrix.append([int(x) for x in input().split()]) if solve(matrix): print("Yes") else: print("No")