Cod sursa(job #1878135)
| Utilizator | Data | 13 februarie 2017 21:35:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#define Ndim 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int D[Ndim][Ndim];
int main()
{
int n,i,j,k;
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(D[i][k] && D[k][j] && (D[i][j]>D[i][k]+D[k][j] || D[i][j]==0) && i!=j)
D[i][j] = D[i][k]+D[k][j];
for(i=1;i<=n;i++,fout<<'\n')
for(j=1;j<=n;j++)
fout<<D[i][j]<<' ';
return 0;
}
