Pagini recente » Cod sursa (job #1590974) | Cod sursa (job #1331751) | Cod sursa (job #727834) | Cod sursa (job #3179150) | Cod sursa (job #2747821)
#include <fstream>
int n;
int a[101][101];
void rw() {
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
int main() {
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
fin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
fin >> a[i][j];
}
fin.close();
rw();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
fout << a[i][j] << ' ';
fout << '\n';
}
fout.close();
return 0;
}