Pagini recente » Cod sursa (job #698206) | Cod sursa (job #2636031) | Cod sursa (job #2602238) | Cod sursa (job #2298142) | Cod sursa (job #2276258)
#include <cstdlib>
#include <cstdio>
using namespace std;
#define MAXN 100
#define MAXV 500
int F[MAXN][MAXN];
int M[MAXN][MAXN];
int n;
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%d", &F[i][j]);
if (F[i][j] == 0 && i != j) {
F[i][j] = MAXV;
}
}
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (F[i][j] > F[i][k] + F[k][j]) {
F[i][j] = F[i][k] + F[k][j];
}
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
printf("%d ", F[i][j]);
}
printf("\n");
}
return 0;
}