Cod sursa(job #2409458)
Utilizator | Matei Trandafir MateiTrandafir | Data | 19 aprilie 2019 00:51:45 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
const int INF = 0x7fffffff;
int n, a[101][101];
int main() {
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int i, j, k;
in >> n;
for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) in >> a[i][j];
for (k = 1; k <= n; ++k) for (i = 1; i <= n; ++i) for (j = 1; j <= n; ++j) if (a[i][k] + a[k][j] < a[i][j]) a[i][j] = a[i][k] + a[k][j];
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) out << a[i][j] << ' ';
out << '\n';
}
return 0;
}