Pagini recente » Cod sursa (job #1199176) | Cod sursa (job #1533502) | Cod sursa (job #2208122) | Cod sursa (job #493174) | Cod sursa (job #2858398)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, dist[105][105];
void Citire()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> dist[i][j];
}
}
}
void RoyFloyd()
{
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if ( dist[i][k] && dist[k][j] && i != j &&
( (dist[i][j] > dist[i][k] + dist[k][j]) || (dist[i][j] == 0) ) )
{
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
void Afisare()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fout << dist[i][j] << ' ';
}
fout << '\n';
}
}
int main()
{
Citire();
RoyFloyd();
Afisare();
return 0;
}