Cod sursa(job #2600746)
Utilizator | Cristea Tudor TudorCristea | Data | 13 aprilie 2020 10:36:58 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.93 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
int D[105][105];
int main()
{
fin >> N;
int i,j;
for (i=1;i<=N;++i)
{
for (j=1;j<=N;++j)
{
fin >> D[i][j];
}
}
int k;
for (k=1;k<=N;++k)
{
for (i=1;i<=N;++i)
{
for (j=1;j<=N;++j)
{
if (D[i][j]!=0 && D[i][k]+D[k][j]<D[i][j])
{
D[i][j]=D[i][k]+D[k][j];
}
else if (D[i][j]==0 && i!=j)
{
D[i][j]=D[i][k]+D[k][j];
}
}
}
}
for (i=1;i<=N;++i)
{
for (j=1;j<=N;++j)
{
fout << D[i][j] << " ";
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}