Cod sursa(job #1322807)
Utilizator | Madalina Zaharescu Ioana MadalinaJacksoon | Data | 20 ianuarie 2015 13:48:03 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, c[101][101];
int main(){
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>c[i][j];
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(c[i][k]==0)continue;
else
if(c[k][j]==0)continue;
else
if(i==j) continue;
else
if(c[i][j]==0||c[i][j]>c[i][k]+c[k][j])
c[i][j]=c[i][k]+c[k][j];
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j)
g<<c[i][j]<<' ';
g<<'\n';
}
g.close();
return 0;
}