Cod sursa(job #2628797)
Utilizator | Stanculescu Gabriel doyouhavethetime | Data | 17 iunie 2020 16:19:47 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
int a[101][101];
int main (void) {
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
fin >> n;
int i, j, k;
for (i=1; i<=n; ++i)
for (j=1; j<=n; ++j) {
fin >> a[i][j];
if (i!=j && !a[i][j])
a[i][j]=0x3F3F3F3F;
}
for (k=1; k<=n; ++k)
for (i=1; i<=n; ++i)
for (j=1; j<=n; ++j)
a[i][j]=min(a[i][j], a[i][k] + a[k][j]);
for (i=1; i<=n; ++i) {
for (j=1; j<=n; ++j)
fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}