Pagini recente » Borderou de evaluare (job #2378615) | Cod sursa (job #2905342) | Cod sursa (job #2691061) | Cod sursa (job #2089298) | Cod sursa (job #326492)
Cod sursa(job #326492)
#include<stdio.h>
int n,i,j,k,a[101][101];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
scanf("%d",&a[i][j]);
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j])&&i!=j) a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}