Cod sursa(job #2622233)
Utilizator | Data | 31 mai 2020 18:49:41 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.87 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,d[101][101],i,j,k;
const int INF=1e9;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>d[i][j];
if(!d[i][j])
d[i][j]=INF;
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(k!=i&&k!=j&&i!=j&&d[k][j]!=INF&&d[i][k]!=INF)
{
d[i][j]=min(d[i][k]+d[k][j],d[i][j]);
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(d[i][j]==INF)
fout<<0<<" ";
else fout<<d[i][j]<<" ";
}
fout<<"\n";
}
}