Pagini recente » Cod sursa (job #254009) | Cod sursa (job #425056) | Cod sursa (job #2323545) | Cod sursa (job #2790184) | Cod sursa (job #3226614)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int const NMAX = 100;
int dist[1 + NMAX][1 + NMAX];
void computeFloyd(int n) {
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];
}
}
}
}
}
int main() {
int n;
in >> n;
for(int i = 1;i <= n;i++) {
for(int j = 1;j <= n;j++) {
in >> dist[i][j];
}
}
computeFloyd(n);
for(int i = 1;i <= n;i++) {
for(int j = 1;j <= n;j++) {
out << dist[i][j] << ' ';
}
out << '\n';
}
return 0;
}