Cod sursa(job #2190562)
| Utilizator | Data | 31 martie 2018 10:40:02 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main(){
int n, a[105][105];
fin>>n;
for(int i =1; i<=n; ++i)
for(int j =1; j<=n; ++j)
fin>>a[i][j];
for(int k = 1; k<=n; ++k){
for(int i = 1; i<=n; ++i){
for(int j = 1; j<=n; ++j){
if(i!=j && a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
}
}
}
for(int i = 1; i<=n; ++i){
for(int j = 1; j<=n; ++j){
fout<<a[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}
