Pagini recente » Cod sursa (job #1420913) | Cod sursa (job #755939) | Cod sursa (job #1437470) | Cod sursa (job #3189762) | Cod sursa (job #2801420)
#include <fstream>
using namespace std;
#define NMAX 1000
int dist[NMAX][NMAX];
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];
}
for ( i = 0; i < n; i++ ) {
for ( j = 0; j < n; j++ ) {
for ( k = 0; k < n; k++ ) {
if ( dist[i][k] + dist[k][j] < dist[i][j] && dist[i][j] > 0 && ( dist[i][k] > 0 || dist[k][j] > 0 ) )
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;
}