Mai intai trebuie sa te autentifici.
Cod sursa(job #2425804)
| Utilizator | Data | 25 mai 2019 02:58:40 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int m[101][101], n;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> m[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 0; j <= n; j++)
if ((m[i][j] == 0 || m[i][j] > m[i][k] + m[k][j]) && m[i][k] && m[i][k] && m[k][j] && i != j)
m[i][j] = m[i][k] + m[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
out << m[i][j] << " ";
out << '\n';
}
return 0;
}
