Pagini recente » Cod sursa (job #741847) | Borderou de evaluare (job #2013463) | Cod sursa (job #3165251) | Cod sursa (job #2320694) | Cod sursa (job #3206023)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, m, d[105][105];
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
in >> d[i][j];
if (i != j && d[i][j] == 0) {
d[i][j] = 1e9;
}
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][j] == 1e9) {
out << 0 << " ";
} else {
out << d[i][j] << " ";
}
}
out << '\n';
}
return 0;
}