Pagini recente » Cod sursa (job #643159) | Cod sursa (job #1310647) | Cod sursa (job #1909691) | Cod sursa (job #1139667) | Cod sursa (job #145628)
Cod sursa(job #145628)
#include<stdio.h>
#define N 100
int n,a[N][N];
void read()
{
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void solve()
{
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]&&(a[i][j]>a[i][k]+a[k][j]||(!a[i][j]&&i!=j)))
a[i][j]=a[i][k]+a[k][j];
}
void afis()
{
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();
solve();
afis();
return 0;
}