Pagini recente » Cod sursa (job #2262243) | Cod sursa (job #1889017) | Cod sursa (job #1132200) | Cod sursa (job #799050) | Cod sursa (job #324789)
Cod sursa(job #324789)
#include<stdio.h>
int a[110][110],n;
void read()
{
scanf("%d",&n);
int i,j;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void rf()
{
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][k] && a[k][j] && i!=j)
{
if (a[i][j]==0 || a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
}
}
void print()
{
int i,j;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
rf();
print();
return 0;
}