Pagini recente » Cod sursa (job #2608934) | Cod sursa (job #3128794) | Cod sursa (job #187359) | Cod sursa (job #160923) | Cod sursa (job #2860689)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 101;
int a[NMAX][NMAX], n;
void roy_floyd()
{
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
if (a[i][k] && a[k][j]) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
fin >> a[i][j];
}
}
roy_floyd();
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
}