Cod sursa(job #2860388)
| Utilizator | Data | 2 martie 2022 15:06:29 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int main()
{
int n;cin>>n;
auto a = new int[n][100];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>a[i][j];
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
a[j][k] = min(a[j][i]+a[i][k], a[j][k]);
if(a[j][k]==0&&j!=k)a[j][k]=a[j][i]+a[i][k];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<a[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}
