Pagini recente » Cod sursa (job #1779398) | Cod sursa (job #1939221) | Cod sursa (job #2472027) | Cod sursa (job #1964423) | Cod sursa (job #1891535)
///FLAVIUS, UBESTE-MA
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin( "royfloyd.in" );
ofstream fout("royfloyd.out");
int n,i,j,v[1010][1010],k;
int main()
{
fin>>n;
for( i = 1 ; i <= n ; i++ )
{
for( j = 1 ; j <= n ; j++ )
{
fin>>v[ i ][ j ];
if( v[ i ][ j ] == 0 )
v[ i ][ j ] = 1000000;
}
}
for( k = 1 ; k <= n ; k++ )
for( i = 1 ; i <= n ; i++ )
for( j = 1 ; j <= n ; j++ )
if( i != j && i != k && j != k )
v[ i ][ j ] = min( v[ i ][ j ] , v[ i ][ k ] + v[ k ][ j ] );
for( i = 1 ; i <= n ; i++ )
{
for( j = 1 ; j <= n ; j++ )
{
if( v[ i ][ j ] < 1000000 )
fout<<v[ i ][ j ]<<' ';
else
fout<<0<<' ';
}
fout<<'\n';
}
return 0;
}