Pagini recente » Cod sursa (job #1562418) | Cod sursa (job #3202877) | Cod sursa (job #746441) | Cod sursa (job #2443947) | Cod sursa (job #1647511)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int G[101][101],i,j,n,m,k,oo=999999;
int main()
{
fin>>n;
for( i = 1 ; i <= n ; i++ )
for( j = 1 ; j <= n ; j++ )
fin>>G[ i ][ j ];
for( i = 1 ; i <= n ; i++ )
for( j = 1 ; j <= n ; j++ )
if( G[ i ][ j ] == 0 )
G[ i ][ j ] = oo;
for( i = 1 ; i <= n ; i++ )
for( j = 1 ; j <= n ; j++ )
for( k = 1 ; k <= n ; k++ )
if( G[ i ][ j ] > G[ i ][ k ] + G[ k ][ j ] && i != j )
G[ i ][ j ] = G[ i ][ k ] + G[ k ][ j ];
for( i = 1 ; i <= n ; i++, fout<<'\n' )
for( j = 1 ; j <= n ; j++ )
fout<<G[ i ][ j ]<<' ';
return 0;
}