Pagini recente » Cod sursa (job #1415601) | Statistici Dan Cojocaru (dancojocaru2000) | Cod sursa (job #2296142) | Atasamentele paginii Profil Dani_951753 | Cod sursa (job #1361058)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int INF=100000, d[10][10], n;
void citire()
{
int i, j, k;
in >> n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
in>>d[i][j];
if(i!=j && d[i][j]==0)
d[i][j]=INF;
}
}
void royfloyd()
{
int i, j, k;
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
}
void afisare()
{
int i, j, k;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
if(d[i][j]==INF)
out<<"0 ";
else
out<<d[i][j]<<" ";
out << "\n";
}
}
int main()
{
citire();
royfloyd();
afisare();
return 0;
}