Pagini recente » Cod sursa (job #1928811) | Cod sursa (job #2758479) | Cod sursa (job #181926) | Cod sursa (job #435431) | Cod sursa (job #2579462)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF = 10000000;
const int N = 101;
int n, pred[N][N], d[N][N];
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] = INF;
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][k] + d[k][j] < d[i][j]) {
d[i][j] = d[i][k] + d[k][j];
pred[i][j] = pred[k][j];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
out << d[i][j] << ' ';
}
out << '\n';
}
return 0;
}