Pagini recente » Cod sursa (job #2188144) | Cod sursa (job #1583220) | Cod sursa (job #2435185) | Cod sursa (job #1182254) | Cod sursa (job #2348460)
#include <fstream>
#define NMax 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main() {
int N;
int d[NMax][NMax];
in >> N;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; j++) {
in >> d[i][j];
}
}
for (int k = 0; k < N; ++k) {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (d[i][k] && d[k][j] && (d[i][k] + d[k][j] < d[i][j] || !d[i][j]) && i != j) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
out << d[i][j] << " ";
}
out << '\n';
}
return 0;
}