Pagini recente » Cod sursa (job #2336792) | Cod sursa (job #2000431) | Cod sursa (job #596928) | Cod sursa (job #1756028) | Cod sursa (job #359459)
Cod sursa(job #359459)
#include<stdio.h>
int n,i,j,k,a[101][101];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
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]);
}
void solve()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
{
if(k==i||!a[i][k])continue;
for(j=1;j<=n;j++)
{
if(k==j||i==j||!a[i][k]||!a[k][j])continue;
if(!a[i][j]||a[i][j]>a[i][k]+a[k][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("%d\n",a[i][n]);
}
}