Cod sursa(job #255919)
Utilizator | Bogolin Vlad vladb | Data | 10 februarie 2009 21:08:04 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream.h>
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101],n;
void roy()
{ for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{ fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
roy();
for(i=1;i<=n;i++)
{ for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}