Pagini recente » Cod sursa (job #2626674) | Cod sursa (job #699041) | Cod sursa (job #59111) | Cod sursa (job #557422) | Cod sursa (job #2559327)
#include <fstream>
#define N 101
using namespace std;
ifstream f ( "royfloyd.in" );
ofstream g ( "royfloyd.out" );
int d[N][N];
int main()
{ int n, i, j, k;
f >> n;
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
f >> d[i][j];
for ( k = 1; k <= n; k++ )
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ )
d[i][j] = min ( d[i][j], d[i][k] + d[k][j] );
for ( i = 1; i <= n; i++ ){
for ( j = 1; j <= n; j++ )
g << d[i][j] << ' ';
g << '\n';
}
return 0;
}