Pagini recente » Cod sursa (job #3312589) | Cod sursa (job #2223054) | Cod sursa (job #3331550) | Monitorul de evaluare | Cod sursa (job #3357954)
#include <fstream>
using namespace std;
const int INF = 1000000000;
int dist[105][105];
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
fin >> dist[i][j];
if (dist[i][j] == 0 && i != j) {
dist[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 (dist[i][k] != INF && dist[k][j] != INF) {
if (dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (dist[i][j] == INF) {
fout << 0 << " ";
} else {
fout << dist[i][j] << " ";
}
}
fout << "\n";
}
fin.close();
fout.close();
return 0;
}