Pagini recente » Cod sursa (job #512011) | Cod sursa (job #511704) | Cod sursa (job #909602) | Cod sursa (job #1901777) | Cod sursa (job #645690)
Cod sursa(job #645690)
#include<stdio.h>
int n,m[111][111];
void roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(m[i][j]>m[i][k]+m[k][j]&&m[i][k]!=0&&m[k][j]!=0)
m[i][j]=m[i][k]+m[k][j];
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&m[i][j]);
if(m[i][j]==0&&i!=j)
m[i][j]=2000000;
}
roy();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(m[i][j]==2000000)
printf("0 ");
printf("%d ",m[i][j]);
}
printf("\n");
}
return 0;
}