Cod sursa(job #2970413)
| Utilizator | Data | 25 ianuarie 2023 08:18:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,a[101][101];
ifstream ci("royfloyd.in");
ofstream cou("royfloyd.out");
int main()
{
ci>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
ci>>a[i][j];
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (i!=j and a[i][k] and a[k][i])
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for (int i=1; i<=n; i++,cou<<'\n')
for (int j=1; j<=n; j++)
cou<<a[i][j]<<" ";
}
