Pagini recente » Cod sursa (job #2276879) | Cod sursa (job #1968588) | Cod sursa (job #3246120) | Cod sursa (job #3213819) | Cod sursa (job #2712129)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nMax = 100 + 5;
int n;
int a[nMax][nMax];
void Royfloyd()
{
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] > a[i][k] + a[k][j] || (!a[i][j] && i != j)))
{
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];
}
}
Royfloyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fout << a[i][j] << ' ';
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}