Pagini recente » Cod sursa (job #2315299) | Cod sursa (job #2765371) | Cod sursa (job #914548) | Cod sursa (job #2539618) | Cod sursa (job #2801449)
#include <fstream>
using namespace std;
#define NMAX 100
#define MAXDIST 10000
int dist[NMAX + 1][NMAX + 1];
ifstream cin ( "royfloyd.in" );
ofstream cout ( "royfloyd.out" );
int main() {
int n, i, j, k;
cin >> n;
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++ ) {
cin >> dist[i][j];
if (i != j && dist[i][j] == 0)
dist[i][j] = MAXDIST * n;
}
}
for ( k = 0; k < n; k++ ) {
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++ ) {
if ( dist[i][k] + dist[k][j] < dist[i][j] )
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++ )
cout << dist[i][j] << " ";
cout << "\n";
}
return 0;
}