Pagini recente » Cod sursa (job #471701) | Cod sursa (job #2661904) | Cod sursa (job #2656307) | Cod sursa (job #2094260) | Cod sursa (job #687368)
Cod sursa(job #687368)
#include<cstdio>
int n, a[105][105];
int min(int x, int y)
{
if(x>y)
return y;
else return x;
}
void citire()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i, j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void rezolvare()
{
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];*/
a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
}
void afisare()
{
int i, j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}