Pagini recente » Cod sursa (job #1775877) | Cod sursa (job #1664654) | Cod sursa (job #1469133) | Cod sursa (job #2655149) | Cod sursa (job #1586023)
#include <fstream>
using namespace std;
int d[102][102];
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> d[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
{
if (d[i][k] == 0)
continue;
for (int j = 1; j <= n; j++)
if (d[k][j] != 0 && i != j)
if (d[i][k] + d[k][j] < d[i][j] || d[i][j] == 0)
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';
}
return 0;
}