Cod sursa(job #2400977)
Utilizator | Andrei Savu asavu16 | Data | 9 aprilie 2019 12:31:08 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int c[120][120],succ[120][120],k,i,j,n;
void royfloyd()
{
for(k=1; k<=n; ++k)
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
if((c[i][j]>c[i][k]+c[k][j]||c[i][j]==0)&&i!=j&&c[i][k]&&c[k][j])
{
c[i][j]=c[i][k]+c[k][j];
}
}
void afis()
{
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
g<<c[i][j]<<" ";
}
g<<'\n';
}
}
int main()
{
f>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
f>>c[i][j];
royfloyd();
afis();
return 0;
}