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

Correcto
|
0.111 s
|
13 KBi |
#2 |

Correcto
|
0.12 s
|
13 KBi |
#3 |

Correcto
|
0.08 s
|
16 KBi |
#4 |

Correcto
|
0.072 s
|
16 KBi |
#5 |

Correcto
|
0.142 s
|
13 KBi |
#6 |

Correcto
|
0.07 s
|
16 KBi |
#7 |

Correcto
|
0.077 s
|
16 KBi |
#8 |

Correcto
|
0.078 s
|
16 KBi |
#9 |

Correcto
|
0.079 s
|
16 KBi |
#10 |

Correcto
|
0.073 s
|
16 KBi |
#11 |

Correcto
|
0.105 s
|
13 KBi |
#12 |

Correcto
|
0.119 s
|
14 KBi |
#13 |

Correcto
|
0.072 s
|
16 KBi |
#14 |

Correcto
|
0.074 s
|
16 KBi |
#15 |

Correcto
|
0.081 s
|
16 KBi |
#16 |

Correcto
|
0.339 s
|
24 KBi |
#17 |

Correcto
|
0.24 s
|
36 KBi |
#18 |

Correcto
|
0.255 s
|
25 KBi |
#19 |

Correcto
|
0.262 s
|
26 KBi |
#20 |

Correcto
|
0.311 s
|
25 KBi |
Puntos totales: 100 / 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 sum = 0, hor = 0, ver = 0, diag = 0, diagi = 0;
String message = "Yes";
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
a[i][j] = sc.nextInt();
}
sum += a[i][i];
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
hor += a[i][j];
ver += a[j][i];
diag += a[j][j];
diagi += a[j][(a.length - j) - 1];
}
if(hor != sum || ver != sum || diag != sum || diagi != sum){
message = "No";
break;
}
hor = 0; ver = 0; diag = 0; diagi = 0;
}
System.out.print(message);
}
}