Pagini recente » Cod sursa (job #687256) | Istoria paginii runda/oji_xi | Cod sursa (job #3134273) | Cod sursa (job #1705570) | Cod sursa (job #3251501)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int inf = 10000000;
int n;
int dist[1005][1005];
int main() {
f >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
f >> dist[i][j];
if (dist[i][j] == 0) dist[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 (i != j)
dist[i][j] = min(dist[i][j], dist[k][j] + dist[i][k]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (dist[i][j] == inf)
g << 0 << ' ';
else
g << dist[i][j] << ' ';
}
g << '\n';
}
return 0;
}