Cod sursa(job #2365775)
| Utilizator | Data | 4 martie 2019 16:22:06 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
#define pinf 999999999
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,k,j,d[110][110];
int main()
{
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(k!=i && k!=j && d[i][k]+d[k][j]<d[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;
}
