Cod sursa(job #2697055)
| Utilizator | Data | 17 ianuarie 2021 16:55:45 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in"); ofstream g("royfloyd.out");
int n, a[102][102];
int main()
{ f>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j) f>>a[i][j];
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
if(a[i][j]>a[i][k]+a[k][j]) a[i][j]=a[i][k]+a[k][j];
for(int i=1; i<=n; ++i)
{ for(int j=1; j<=n; ++j) g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}
