Pagini recente » Cod sursa (job #354552) | Cod sursa (job #124938) | Cod sursa (job #19613) | Istoria paginii preoni-2007/clasament/11-12 | Cod sursa (job #2084444)
#include <fstream>
#define LMAX 105
#define INF 999999999
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int c[LMAX][LMAX];
int n;
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
fin>>c[i][j];
if (!c[i][j]&&i!=j) c[i][j]=INF;
}
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (c[i][k]+c[k][j]<c[i][j])
{
c[i][j]=c[i][k]+c[k][j];
}
for (int i=1;i<=n;i++)
{for (int j=1;j<=n;j++)
if (c[i][j]==INF)
fout<<0<<' ';
else
fout<<c[i][j]<<' ';
fout<<'\n';}
fin.close();
fout.close();
return 0;
}