Pagini recente » Cod sursa (job #2022718) | Cod sursa (job #132832) | Cod sursa (job #1630831) | Cod sursa (job #1011694) | Cod sursa (job #272168)
Cod sursa(job #272168)
#include<fstream.h>
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
# define max 1020
int a[100][100],n;
void lung()
{int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{fin>>a[i][j];
if(a[i][j]==0)
if(i==j)a[i][j]=0;
else a[i][j]=max;
}
lung();
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}