Cod sursa(job #3323577)
| Utilizator | Data | 18 noiembrie 2025 18:58:31 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101];
int main()
{
int n, i, j, k;
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] < 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";
}
return 0;
}