Pagini recente » Cod sursa (job #2301323) | Cod sursa (job #544122) | Cod sursa (job #638312) | Cod sursa (job #1595281) | Cod sursa (job #2900761)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define NMAX 105
int n;
long long dist[NMAX][NMAX];
void roy_floyd() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (i == j || k == i || k == j) continue;
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
int main()
{
in >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
in >> dist[i][j];
if (dist[i][j] == 0) {
dist[i][j] = INT_MAX;
}
}
}
roy_floyd();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (dist[i][j] == INT_MAX) dist[i][j] = 0;
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
out << dist[i][j] << " ";
}
out << "\n";
}
return 0;
}