Cod sursa(job #2279347)
Utilizator | Predescu Sebastian Ion PredescuSebastianIon | Data | 9 noiembrie 2018 14:30:51 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[102][102],d[102][102];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
f>>a[i][j];
d[i][j]=a[i][j];
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i!=j && j!=k && i!=k && (d[i][j]==0 || (d[i][k]+d[k][j]<d[i][j])))
{
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
g<<d[i][j]<<" ";
}
g<<'\n';
}
return 0;
}