Cod sursa(job #1511250)
| Utilizator | Data | 26 octombrie 2015 11:31:15 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[105][105];
int main(){
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(a[i][k] && a[k][j]){
if(a[i][k]+a[k][j]<a[i][j] || (!a[i][j] && 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;
}
