Cod sursa(job #3215456)
Utilizator | stefandutahoria stefanduta | Data | 14 martie 2024 23:29:55 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
#define NMAX 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int v[NMAX][NMAX];
int main()
{
int n, i, j, k;
in >> n;
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
in >> v[i][j];
}
for (k = 1; k <= n; ++k)
{
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
{
if (v[i][j] > v[i][k] + v[k][j])
v[i][j] = v[i][k] + v[k][j];
}
}
}
for (i = 1; i <= n; ++i)
{
for (j = 1; j <= n; ++j)
out << v[i][j] << " ";
out << '\n';
}
return 0;
}