Pagini recente » Cod sursa (job #2819116) | Cod sursa (job #2116320) | usu2 | Cod sursa (job #1116355) | Cod sursa (job #1512763)
#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 110;
const int VALMAX = 100000000;
int N;
int d[NMAX][NMAX];
int main () {
freopen ("royfloyd.in", "r", stdin);
freopen ("royfloyd.out", "w", stdout);
scanf ("%d", &N);
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
scanf ("%d", &d[i][j]);
}
}
for (int k = 1; k <= N; k++) {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i != j && d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || d[i][j] == 0)) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
printf ("%d ", d[i][j]);
}
printf ("\n");
}
return 0;
}