Mai intai trebuie sa te autentifici.
Cod sursa(job #3293630)
Utilizator | Data | 12 aprilie 2025 10:07:10 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m;
int L[105][105];
int main()
{
int i, j, k;
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> L[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
if (i != k)
for (j = 1; j <= n; j++)
if (i != j && L[i][k] != 0 && L[k][j] != 0 && (L[i][j] > L[i][k] + L[k][j] || L[i][j] == 0))
L[i][j] = L[i][k] + L[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout << L[i][j] << " ";
fout << "\n";
}
return 0;
}