Cod sursa(job #2781441)
| Utilizator | Data | 9 octombrie 2021 15:53:06 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int n, a[101][101];
int main ()
{
in >> n;
for (int i = 1;i<=n;++i)
for (int j = 1;j<=n;++j)
in >> a[i][j];
for (int k = 1;k<=n;++k)
for (int i = 1;i<=n;++i)
for (int j = 1;j<=n;++j)
if (i != k && k != j && a[i][k] && a[k][j] && a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
for (int i = 1;i<=n;++i)
{
for (int j = 1;j<=n;++j)
out << a[i][j] << ' ';
out << '\n';
}
}
