Pagini recente » Cod sursa (job #1693725) | Cod sursa (job #1215909) | Cod sursa (job #368176) | Cod sursa (job #290486) | Cod sursa (job #3136795)
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int mxN = 105, inf = 1e9;
int n, d[mxN][mxN];
void readInput() {
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;
}
}
}
}
void floydWarshall() {
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];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i != j && d[i][j] == inf) {
d[i][j] = 0;
}
}
}
}
int main() {
readInput();
floydWarshall();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fout << d[i][j] << " ";
}
fout << "\n";
}
return 0;
}