Pagini recente » Cod sursa (job #2375861) | Cod sursa (job #855242) | Cod sursa (job #1185363) | Cod sursa (job #2750941) | Cod sursa (job #1113708)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int main()
{
int i,j,k,n,c[110][110];
fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
fin>>c[i][j];
if (!c[i][j]&&i!=j)
c[i][j]=2000000000;
}
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
for (k=1;k<=n;k++)
if (c[j][k]>c[j][i]+c[i][k])
c[j][k]=c[j][i]+c[i][k];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
fout<<c[i][j]<<' ';
fout<<'\n';
}
fin.close ();
fout.close ();
return 0;
}