Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 2 KBi |
#3 |
Correcto
|
0.004 s | 11 KBi |
#4 |
Incorrecto
|
0.003 s | 23 KBi |
#5 |
Correcto
|
0.004 s | 20 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Incorrecto
|
0.004 s | 11 KBi |
#8 |
Correcto
|
0.006 s | 12 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.004 s | 10 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 2 KBi |
#13 |
Correcto
|
0.004 s | 21 KBi |
#14 |
Correcto
|
0.005 s | 2 KBi |
#15 |
Correcto
|
0.004 s | 35 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Correcto
|
0.007 s | 1 KBi |
#18 |
Correcto
|
0.006 s | 10 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.006 s | 2 KBi |
#include <stdio.h> #include <stdlib.h> int main() { int i, j, N, *arr, col, fila, diag1, diag2, prev = 0; fscanf(stdin, "%d", &N); arr = (int *)malloc(sizeof(int) * N * N); for (i = 0; i < N; i++) { j = 0; while (j < N && fscanf(stdin, "%d", arr + i * N + j++) == 1) ; } // Sumas de columnas y filas for (i = 0; i < N; i++) { col = 0; fila = 0; diag1 = 0; diag2 = 0; for (j = 0; j < N; j++) { col += *(arr + j * N + i); fila += *(arr + i * N + j); diag1 += *(arr + j * N + j); diag2 += *(arr + (N - 1 - j) * N + N - 1 - j); } // printf("col = %d / fila = %d / diag1 = %d / diag2 = %d\n", col, fila, diag1, diag2); if (!(col == fila && fila == diag1 && diag1 == diag2) || (i != 0 && col != prev)) { printf("No\n"); free(arr); return 0; } else { prev = col; // Tomamos cualquiera } } printf("Yes\n"); free(arr); return 0; }