Cod sursa(job #2912009)
| Utilizator | Data | 6 iulie 2022 16:22:56 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], n;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>a[i][j];
fin.close();
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if((a[i][j] > a[i][k] + a[k][j]) && i!=j && a[i][k]!=0 && a[k][j]!=0)
a[i][j]=a[i][k] + a[k][j];
for(int i=1; i<=n; i++, fout<<'\n')
for(int j=1; j<=n; j++)
fout<<a[i][j]<<' ';
fout.close();
return 0;
}
