Pagini recente » Cod sursa (job #2270433) | Cod sursa (job #2298670) | Cod sursa (job #686535) | Cod sursa (job #1845789) | Cod sursa (job #2867670)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,i,j,d[105][105],m,x,y,inter;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>d[i][j];
}
}
for(inter=1;inter<=n;inter++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(d[i][inter] and d[inter][j] and i!=j)
{
if(d[i][j]==0) d[i][j]=d[i][inter]+d[inter][j];
else d[i][j]=min(d[i][j],d[i][inter]+d[inter][j]);
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<d[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}