Pagini recente » Cod sursa (job #2649558) | Cod sursa (job #219842) | Cod sursa (job #1165058) | Cod sursa (job #1555819) | Cod sursa (job #2213688)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int MAXN = 100;
int n, g[MAXN + 1][MAXN + 1];
int main() {
in >> n;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
in >> g[i][j];
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
for (int k = 1; k <= n; ++ k) {
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
out << g[i][j] << ' ';
}
out << '\n';
}
return 0;
}