Cod sursa(job #3339120)
| Utilizator | Data | 6 februarie 2026 14:02:47 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#define NMAX 102
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int d[NMAX][NMAX];
int main()
{
int i,j,x,y,z;
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>d[i][j];
for(z=1; z<=n; z++)
for(x=1; x<=n; x++)
for(y=1; y<=n; y++)
d[x][y]=min(d[x][y],d[x][z]+d[z][y]);
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout<<d[i][j]<<' ';
fout<<'\n';
}
return 0;
}
