Cod sursa(job #3138202)
Utilizator | Data | 18 iunie 2023 07:43:02 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream F("1.in");
ofstream G("1.out");
int i,j,k,n,a[1000][1000];
int main()
{
for(F>>n;i<n;++i)
for(j=0;j<n;F>>a[i][j++]);
for(;k<n;++k)
for(i=0;i<n;++i)
for(j=0;j<n;i!=j&&a[i][k]&&a[k][j]&&(!a[i][j]||a[i][j]>a[i][k]+a[k][j])?a[i][j]=a[i][k]+a[k][j]:0,++j);
for(i=0;i<n;G<<'\n',++i)
for(j=0;j<n;G<<a[i][j++]<<' ');
return 0;
}