Pagini recente » Cod sursa (job #305168) | Cod sursa (job #1108734) | Cod sursa (job #336567) | Cod sursa (job #2521987) | Cod sursa (job #2579474)
#include <fstream>
#include <climits>
int d[101][101];
const int INF = INT_MAX;
int main() {
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
int n;
fin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> d[i][j];
if (i != j && d[i][j] == 0) {
d[i][j] = INF;
}
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][k] + d[k][j] < d[i][j]) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (d[i][j] == INF) {
d[i][j] = 0;
}
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}