Pagini recente » Cod sursa (job #3366422) | Cod sursa (job #3366420) | Cod sursa (job #3366184) | Cod sursa (job #3366421) | Cod sursa (job #3366721)
#include <fstream>
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
int n;
int d[105][105], answer[105][105];
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> d[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i != j) {
for (int k = 1; k <= n; k++) {
if (i != k && j != k && (d[i][j] == 0 || (d[i][j] > d[i][k] + d[k][j] && d[i][k] > 0 && d[k][j] > 0))) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fout << d[i][j] << " ";
}
fout << "\n";
}
fout.close();
}