Pagini recente » Cod sursa (job #798012) | Cod sursa (job #1989639) | Cod sursa (job #3270752) | Cod sursa (job #799757) | Cod sursa (job #2409459)
#include <fstream>
const int INF = 10000;
int n, a[101][101];
int main() {
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int i, j, k;
in >> n;
for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) {
in >> a[i][j];
if (a[i][j] == 0) a[i][j] = INF;
}
for (k = 1; k <= n; ++k) for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) {
if (i == j) continue;
if (a[i][k] + a[k][j] < a[i][j]) a[i][j] = a[i][k] + a[k][j];
}
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
if (a[i][j] != INF) out << a[i][j] << ' ';
else out << "0 ";
}
out << '\n';
}
return 0;
}