Pagini recente » Cod sursa (job #1419984) | Cod sursa (job #3200084) | Cod sursa (job #2030273) | Cod sursa (job #1305859) | Cod sursa (job #2523264)
#include <bits/stdc++.h>
using namespace std;
#define inf LLONG_MAX
#define ll long long
ifstream fin( "royfloyd.in" );
ofstream fout( "royfloyd.out" );
int n;
void roy_floyd( int n )
{
ll r[n + 5][n + 5];
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
fin >> r[i][j];
for( int k = 1; k <= n; k++ )
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
if( r[i][j] > r[i][k] + r[k][j] )
r[i][j] = r[i][k] + r[k][j];
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
fout << r[i][j] << ' ';
fout << '\n';
}
}
int main()
{
fin >> n;
roy_floyd( n );
return 0;
}