Cod sursa(job #2633092)
Utilizator | Data | 6 iulie 2020 14:15:16 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[101][101];
int main()
{
int n, i, j, k;
fin >> n;
for (i = 1; i<=n; i++)
for (j = 1; j<=n; j++)
fin >> m[i][j];
for (k = 1; k<=n; k++)
for (i = 1; i<=n; i++)
for (j = 1; j<=n; j++)
if (m[i][k] && m[k][j] && (m[i][j] == 0 || m[i][j] > m[i][k] + m[k][j]) && i != j)
m[i][j] = m[i][k] + m[k][j];
for (i = 1; i<=n; i++, fout << '\n')
for (j = 1; j<=n; j++, fout << ' ')
fout << m[i][j];
return 0;
}