Pagini recente » Cod sursa (job #1523109) | Cod sursa (job #2049924) | Cod sursa (job #2133528) | Cod sursa (job #2846376) | Cod sursa (job #3238944)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105];
int main()
{
f >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
f >> a[i][j];
if (a[i][j] == 0) {
a[i][j] = 1e9;
}
}
}
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][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][j] == 1e9) {
a[i][j] = 0;
}
g << a[i][j] << ' ';
}
g << '\n';
}
return 0;
}