Pagini recente » Cod sursa (job #2135528) | Cod sursa (job #2551502) | Cod sursa (job #3259765) | Cod sursa (job #1084660) | Cod sursa (job #1128475)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 0x3f3f3f3f;
int N;
int best[105][105];
void Read() {
fin >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j) {
fin >> best[i][j];
if (i == j || best[i][j] == 0)
best[i][j] = INF;
}
}
void RoyFloyd() {
for (int k = 1; k <= N; ++k)
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
best[i][j] = min(best[i][j], best[i][k] + best[k][j]);
}
void Write() {
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j)
fout << (i == j ? 0 : best[i][j]) << ' ';
fout << '\n';
}
}
int main() {
Read();
RoyFloyd();
Write();
fin.close();
fout.close();
return 0;
}