Pagini recente » Cod sursa (job #170136) | Cod sursa (job #63957) | Cod sursa (job #1822087) | Cod sursa (job #1494464) | Cod sursa (job #1240838)
#include <iostream>
#include <fstream>
#define MAXN 105
std::ifstream f("royfloyd.in");
std::ofstream g("royfloyd.out");
int n;
int a[MAXN][MAXN];
int main()
{
f >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
f >> a[i][j];
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
if (a[i][k] == 0) {
continue;
}
for (int j = 1; j <= n; j++) {
if (a[j][k] == 0) {
continue;
}
a[i][j] = std::min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
g << a[i][j] << ' ';
}
g << '\n';
}
f.close();
g.close();
return 0;
}