Cod sursa(job #2964875)
Utilizator | Turbinca Gabriel aaagabi | Data | 14 ianuarie 2023 09:22:21 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int c[105][105],n;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>c[i][j];
for(int z=1;z<=n;z++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(c[i][z]!=0&&c[z][i]!=0&&c[i][j]!=0)
c[i][j]=min(c[i][j],c[i][z]+c[z][j]);
for(int i=1;i<=n;i++,fout<<'\n')
for(int j=1;j<=n;j++)
fout<<c[i][j]<<' ';
return 0;
}