Cod sursa(job #3291334)
| Utilizator | Data | 4 aprilie 2025 10:47:43 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105], d[105][105];
int main(){
fin >> n;
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
fin >> a[i][j];
d[i][j] = a[i][j];
}
}
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
for (int k=0; k<n; k++){
if (d[i][j] > d[i][k] + d[k][j]){
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i=0; i<n; i++){
for (int j=0; j<n; j++){
fout << d[i][j] << ' ';
}
fout << '\n';
}
return 0;
}
