Cod sursa(job #2680524)
| Utilizator | Data | 3 decembrie 2020 18:18:43 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nmax=100;
int d[nmax+1][nmax+1];
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
fin>>d[i][j];
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(d[i][j]>d[i][k]+d[k][j]){
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
fout<<d[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}
