Cod sursa(job #1725689)
Utilizator | Data | 6 iulie 2016 10:39:35 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int v[110][110];
int main()
{
ifstream in("royfloyd.in");
int n;
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> v[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (v[j][i] > v[j][k] + v[k][i])
v[j][i] = v[j][k] + v[k][i];
ofstream out("royfloyd.out");
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
out << v[i][j] << " \n"[j == n];
in.close();
out.close();
return 0;
}