Pagini recente » Cod sursa (job #2378272) | Cod sursa (job #609067) | Cod sursa (job #1823208) | Cod sursa (job #2334960) | Cod sursa (job #2132482)
#include <iostream>
#include <fstream>
#define NMAX (100 + 3)
using namespace std;
int main() {
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, i, j, k, distance[NMAX][NMAX];
f >> n;
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
f >> distance[i][j];
}
}
for (k = 0; k < n; ++k) {
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
if (i != j && distance[i][k] != 0 && distance[k][j] != 0 && (distance[i][k] + distance[k][j]
< distance[i][j] || distance[i][j] == 0)) {
distance[i][j] = distance[i][k] + distance[k][j];
}
}
}
}
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
g << distance[i][j] << " ";
}
g << "\n";
}
return 0;
}