Pagini recente » Cod sursa (job #1293865) | Cod sursa (job #2135376) | Cod sursa (job #383040) | Cod sursa (job #2071595) | Cod sursa (job #2683884)
#include <fstream>
#define Nmax 103
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int d[Nmax][Nmax];
void citire()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> d[i][j];
}
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(i != j && d[i][k] && d[k][j] && (d[i][j] > d[k][j] + d[i][k] || !d[i][j]))
d[i][j] = d[k][j] + d[i][k];
}
void afisare()
{
for(int i = 1; i <= n; i++, fout << '\n')
for(int j = 1; j <= n; j++, fout << ' ')
fout << d[i][j];
}
int main()
{
citire();
Roy_Floyd();
afisare();
return 0;
}