Pagini recente » Cod sursa (job #2574739) | Cod sursa (job #1716647) | Cod sursa (job #15585) | Cod sursa (job #509252) | Cod sursa (job #3263516)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define NMAX 105
int a[NMAX][NMAX];
void roy_floyd(int n) {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (i != j && a[i][k] && a[k][j]) {
if (a[i][j] == 0 || a[i][j] > a[i][k] + a[k][j]) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
}
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
fin >> a[i][j];
}
}
roy_floyd(n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}