Pagini recente » Cod sursa (job #132091) | Cod sursa (job #552189) | Cod sursa (job #3258643) | Cod sursa (job #2063864) | Cod sursa (job #2488750)
#include <bits/stdc++.h>
const int MAX_N = 105;
const int INF = (1 << 25);
int n;
int g[MAX_N][MAX_N];
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", &g[i][j]);
if (g[i][j] == 0) {
g[i][j] = INF;
}
}
}
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (g[i][k] > 0 && g[k][j] > 0) {
g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);
}
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (g[i][j] == INF || i == j) {
g[i][j] = 0;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
printf("%d ", g[i][j]);
}
printf("\n");
}
#ifdef LOCAL_DEFINE
std::cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}