Mai intai trebuie sa te autentifici.
Cod sursa(job #2105554)
| Utilizator | Data | 13 ianuarie 2018 16:22:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <iostream>
#include <fstream>
#define N 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int rf[N][N], n;
void roy_floyd() {
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i != j && rf[i][k] && rf[k][j] && rf[i][j] > rf[i][k] + rf[k][j])
rf[i][j] = rf[i][k] + rf[k][j];
}
}
}
}
int main() {
in >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
in >> rf[i][j];
}
roy_floyd();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
out << rf[i][j] << " ";
out << "\n";
}
return 0;
}
