Cod sursa(job #1756927)
Utilizator | Data | 13 septembrie 2016 22:24:03 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[104][104],n;
void read()
{
int i,j;
fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
fin>>d[i][j];
}
int main()
{
int i,j,k;
read();
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (d[i][k] && d[k][j] && i!=j) 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 (i!=j) fout<<d[i][j]<<" ";
else fout<<"0 ";
fout<<'\n';
}
}