Cod sursa(job #2570581)
Utilizator | Cretoiu Patricia PatriciaCretoiu | Data | 4 martie 2020 17:50:32 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | r3capitusulare | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 105;
int n, i, j, k, a[N][N];
int main()
{
in >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <=n; j++)
in >> a[i][j];
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(a[i][k] && a[k][j] && i != j && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
out << a[i][j] << ' ';
out << '\n';
}
}