Cod sursa(job #2941145)
Utilizator | Data | 17 noiembrie 2022 10:43:01 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.84 kb |
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,i,j,k,v[105][105];
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
fin>>v[i][j];
if (v[i][j]==0)
v[i][j]=100005;
}
}
for (k=1; k<=n; k++)
{
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (v[i][k]+v[k][j]<v[i][j]&&v[i][j]!=100005)
v[i][j]=v[i][k]+v[k][j];
}
}
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (v[i][j]==100005)
fout<<0<<" ";
else
fout<<v[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}