Pagini recente » Cod sursa (job #3210888) | Cod sursa (job #2523119) | Cod sursa (job #2096035) | Cod sursa (job #1386290) | Cod sursa (job #2696206)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
const int N_MAX = 100005;
const int INF = 1e9;
int matrix[105][105];
int n;
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 >> matrix[i][j];
if (matrix[i][j] == 0 and i != j)
matrix[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 (matrix[i][k] + matrix[k][j] < matrix[i][j])
matrix[i][j] = matrix[i][k] + matrix[k][j];
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (matrix[i][j] == INF)
fout << 0 << " ";
else
fout << matrix[i][j] << " ";
}
fout << '\n';
}
return 0;
}