Cod sursa(job #3001026)
| Utilizator | Data | 13 martie 2023 10:16:00 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int dim = 1001;
int G[dim][dim];
int main()
{
int n, i, j, k;
cin >> n;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
cin >> G[i][j];
for (k = 1; k <= n; ++k)
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if (G[i][j] > G[i][k] + G[k][j])
G[i][j] = G[i][k] + G[k][j];
for (i = 1; i <= n; ++i, cout << '\n')
for (j = 1; j <= n; ++j)
cout << G[i][j] << ' ';
return 0;
}
