Cod sursa(job #1497691)
Utilizator | Data | 7 octombrie 2015 09:49:28 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105],n,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(i!=j || !a[i][j])
a[i][j]=min(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";
}
return 0;
}