Cod sursa(job #2528245)
Utilizator | Carla Diana CarlaDiana | Data | 21 ianuarie 2020 17:50:57 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,ma[110][110];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fin>>ma[i][j];
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(ma[i][k]!=0&&ma[k][j]!=0&&i!=j)
{
if(ma[i][j]==0)
ma[i][j]=ma[i][k]+ma[k][j];
else
ma[i][j]=min(ma[i][j],ma[i][k]+ma[k][j]);
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<ma[i][j]<<" ";
fout<<'\n';
}
return 0;
}