Cod sursa(job #3301113)
| Utilizator | Data | 21 iunie 2025 19:29:37 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, v[101][101];
int main()
{
fin>>n;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
fin>>v[i][j];
}
}
for (int k=1; k<=n; k++)
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
if (v[i][j]>v[i][k]+v[k][j] and i!=k and j!=k)
{
v[i][j]=v[i][k]+v[k][j];
}
}
}
}
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
fout<<v[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}