Pagini recente » Cod sursa (job #500985) | Cod sursa (job #398080) | Cod sursa (job #2672778) | Cod sursa (job #679746) | Cod sursa (job #2579468)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 10000000;
const int N = 101;
int n, pred[N][N], d[N][N];
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> 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++) {
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}