Pagini recente » Cod sursa (job #209684) | Cod sursa (job #626201) | Cod sursa (job #1107359) | Cod sursa (job #2589439) | Cod sursa (job #2756311)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMAX = 101, INF = 1e6;
int n, p[NMAX][NMAX];
int main()
{
in >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
in >> p[i][j];
if (i != j && p[i][j] == 0)
p[i][j] = INF;
}
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (p[i][j] > p[i][k] + p[k][j])
p[i][j] = p[i][k] + p[k][j];
for (int i = 1; i <= n; ++i, out << '\n')
{
for (int j = 1; j <= n; ++j)
{
if (i != j && p[i][j] == INF)
p[i][j] = 0;
out << p[i][j] << ' ';
}
}
return 0;
}