Pagini recente » Cod sursa (job #2707999) | Borderou de evaluare (job #1509968) | Cod sursa (job #1239923) | Cod sursa (job #306910) | Cod sursa (job #927506)
Cod sursa(job #927506)
#include<cstdio>
int a[101][101],n,i,j,k;
void citire()
{
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 roy()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) && i!=j)a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
citire();
roy();
afisare();
return 0;
}