Pagini recente » Cod sursa (job #963403) | Borderou de evaluare (job #1278312) | Cod sursa (job #563814) | Cod sursa (job #726159) | Cod sursa (job #692545)
Cod sursa(job #692545)
#include<stdio.h>
int n,i,j,k,a[102][102];
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(i!=j&&a[i][k]&&a[k][j])
{
if(a[i][j])
{
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
else
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;
}