Cod sursa(job #2998472)
| Utilizator | Data | 9 martie 2023 16:18:37 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int v[101][101];
int main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>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][k] + v[k][j] < v[i][j]) && i!=j)
v[i][j]=v[i][k]+v[k][j];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
g<<v[i][j]<<" ";
g<<'\n';
}
return 0;
}
