Pagini recente » Cod sursa (job #1390999) | Cod sursa (job #1404634) | Cod sursa (job #3225203) | Cod sursa (job #2535370) | Cod sursa (job #1266122)
#include <cstdio>
#define Nmax 110
using namespace std;
int n,i,j;
int a[Nmax][Nmax];
inline void royfloyd()
{
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] && i!=j && (a[i][j]>a[i][k]+a[k][j] || !a[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 (i=1;i<=n;++i)
for (j=1;j<=n;++j)
scanf("%d", &a[i][j]);
royfloyd();
for (i=1;i<=n;++i)
{
for (j=1;j<=n;++j)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}