Pagini recente » Cod sursa (job #1784551) | Cod sursa (job #1517334) | Cod sursa (job #2562157) | Cod sursa (job #676969) | Cod sursa (job #1610303)
#include <fstream>
using namespace std;
const int N_MAX = 100;
const int INF = 1e9;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
int dist[N_MAX + 5][N_MAX + 5];
int main() {
fin >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j) {
fin >> dist[i][j];
if (i != j && dist[i][j] == 0)
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)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j)
fout << (dist[i][j] != INF) * dist[i][j] << " ";
fout << "\n";
}
return 0;
}