Pagini recente » Cod sursa (job #296090) | Cod sursa (job #1587085) | Cod sursa (job #1517162) | Cod sursa (job #854670) | Cod sursa (job #333873)
Cod sursa(job #333873)
#include<cstdio>
#define MAXN 101
int i , j , k , A[MAXN][MAXN] , N ;
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]);
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][k] + A[k][j] < A[i][j] || !A[i][j] ) && i !=j ) A[i][j] = A[i][k] + A[k][j] ;
for( i = 1 ; i <= N ; ++i ) {
for( j = 1 ; j <= N ; ++j )
printf("%d ",A[i][j]);
printf("\n");
}
return 0;
}