Cod sursa(job #2282683)
| Utilizator | Data | 14 noiembrie 2018 12:30:01 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#define NMAX 105
#define inf NMAX*NMAX*1000
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int n;
int dist[NMAX][NMAX];
int main()
{
int i,j,k;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
in>>dist[i][j];
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(dist[i][j]!=0 and dist[i][j]>dist[i][k]+dist[k][j]){
dist[i][j]=dist[i][k]+dist[k][j];
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
out<<dist[i][j]<<' ';
out<<'\n';
}
return 0;
}
