Pagini recente » Cod sursa (job #922077) | Cod sursa (job #2527285) | Cod sursa (job #2173311) | Cod sursa (job #2305356) | Cod sursa (job #810668)
Cod sursa(job #810668)
#include<stdio.h>
#define nmax 102
long i, j, n, k, ma[nmax][nmax];
void citire()
{
scanf("%ld",&n);
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
scanf("%ld",&ma[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 ((ma[i][k])&&(ma[k][j]))
if ((ma[i][k]+ma[k][j]<ma[i][j])||(ma[i][j]==0))
ma[i][j]=ma[i][k]+ma[k][j];
}
void afisare()
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
printf("%ld ",ma[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
rezolvare();
afisare();
return 0;
}