Pagini recente » Cod sursa (job #2081532) | Cod sursa (job #1507577) | Cod sursa (job #1111959)
#include<stdio.h>
#define nmax 105
int i, j, k, n;
int cmin[nmax][nmax];
void citire()
{
scanf("%ld",&n);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
scanf("%ld",&cmin[i][j]);
}
void rezolvare()
{
for(k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i!=j)
if ((cmin[i][k]*cmin[k][j]>0) && ((cmin[i][k]+cmin[k][j]<cmin[i][j])||(cmin[i][j]==0)))
cmin[i][j]=cmin[i][k]+cmin[k][j];
}
void afisare()
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
printf("%ld ",cmin[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
rezolvare();
afisare();
return 0;
}