Pagini recente » Cod sursa (job #3165520) | Cod sursa (job #2551181) | Cod sursa (job #1605276) | Cod sursa (job #730516) | Cod sursa (job #1077782)
#include <stdio.h>
#define maxn 105
int n,a[maxn][maxn];
void RF()
{
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if (a[i][k]&&a[k][j]&&((a[i][k]+a[k][j]<a[i][j])||(!a[i][j]))&&(i!=j)) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
scanf("%d", &a[i][j]);
RF();
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}