Pagini recente » Cod sursa (job #351514) | Borderou de evaluare (job #2666590) | Cod sursa (job #1273994) | Cod sursa (job #1435833) | Cod sursa (job #1277699)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int n, a[101][101];
int main()
{
is >> n;
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
is >> a[i][j];
for ( int k = 1; k <= n; ++k )
for ( int i = 1; i <= n; ++i )
for( int j = 1; j<= n; ++j )
if ( i != j && a[i][j] > a[i][k] + a[k][j] )
a[i][j] = a[i][k] + a[k][j];
for ( int i = 1; i <= n; ++i )
{
for ( int j = 1; j <= n; ++j )
os << a[i][j] << ' ';
os << '\n';
}
is.close();
os.close();
return 0;
}