Pagini recente » Cod sursa (job #1200783) | Cod sursa (job #2620962) | Cod sursa (job #982781) | Cod sursa (job #521210) | Cod sursa (job #2211457)
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
const int INF = 2000000;
int k, i, j, n, p[102][102];
int main()
{
f >> n;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
f >> p[i][j];
if (p[i][j] == 0 && i != j) 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] && i != j)
{
p[i][j] = p[i][k] + p[k][j];
}
}
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
g << p[i][j] << " ";
}
g << '\n';
}
return 0;
}