Pagini recente » Cod sursa (job #1849367) | Cod sursa (job #301705) | Cod sursa (job #3354822) | Cod sursa (job #396227) | Cod sursa (job #1647501)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int G[101][101],i,j,n,m,k;
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++ )
for( k = 1 ; k <= n ; k++ )
if( G[ i ][ j ] > G[ i ][ k ] + G[ k ][ 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;
}