Pagini recente » Cod sursa (job #2474152) | Cod sursa (job #349451) | Cod sursa (job #3266206) | Cod sursa (job #2169400) | Cod sursa (job #2819602)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 100;
int n, ad[NMAX + 5][NMAX + 5];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
fin >> ad[i][j];
}
}
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (ad[i][k] && ad[k][j] && ad[i][k] + ad[k][j] < ad[i][j])
{
ad[i][j] = ad[i][k] + ad[k][j];
}
}
}
}
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
fout << ad[i][j] << ' ';
}
fout << '\n';
}
return 0;
}