Cod sursa(job #2848121)
Utilizator | Morosanu Alexandru alexmorosanu | Data | 12 februarie 2022 10:19:32 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,a[111][111],k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) && i!=j)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++,g<<'\n')
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
return 0;
}