Pagini recente » Cod sursa (job #2344526) | Borderou de evaluare (job #1504384) | Borderou de evaluare (job #1110588) | Borderou de evaluare (job #2046222) | Cod sursa (job #2209873)
#include <fstream>
#define NMAX 105
#define INF 1e9
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int dist[NMAX][NMAX];
void read_data(int& n){
f >> n;
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
f >> dist[i][j];
}
}
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
if(i == j){
dist[i][j] = 0;
}
if(i != j && dist[i][j] == 0){
dist[i][j] = INF;
}
}
}
}
void roy_floyd(){
for(int k = 1; k<=n; k++){
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
if(dist[i][k] + dist[k][j] < dist[i][j]){
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
void print_sol(){
for(int i = 1; i<=n; i++){
for(int j = 1; j<=n; j++){
dist[i][j] != INF ? g << dist[i][j] << ' ' : g << 0 << ' ';
}
g << '\n';
}
}
int main(){
read_data(n);
roy_floyd();
print_sol();
return 0;
}