Cod sursa(job #3275816)
| Utilizator | Data | 11 februarie 2025 19:57:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[120][120];
int32_t main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>a[i][j];
for(int t=1; t<=n; t++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j]=min(a[i][j],a[i][t]+a[t][j]);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}
