Cod sursa(job #2543388)
Utilizator | Data | 11 februarie 2020 09:07:59 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.8 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,k,d[101][101];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>d[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
if(i!=j&&d[i][j]==0)
{
d[i][j]=d[i][k]+d[k][j];
}
if(d[i][j]>d[i][k]+d[k][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<<endl;
}
return 0;
}