Cod sursa(job #1657765)
Utilizator | Data | 20 martie 2016 19:44:48 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[101][101],i,j,k;
int main(){
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>a[i][j];
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if((a[i][j]!=0 && a[i][k]+a[k][j]<a[i][j]) ||(a[i][j]==0)){
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
fout.close();
fin.close();
return 0;
}