Pagini recente » Cod sursa (job #2873023) | Cod sursa (job #3003660) | Cod sursa (job #3272211) | Cod sursa (job #1440922) | Cod sursa (job #3279682)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, k, i, j, d[101][101];
in >> n;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j) {
in >> d[i][j];
if (d[i][j] == 0 && i != j)
d[i][j] = 1001;
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
{
out << d[i][j] << ' ';
}
out << '\n';
}
in.close();
return 0;
}