Cod sursa(job #2810679)
Utilizator | Mihai Radu-Ioan rimihai | Data | 29 noiembrie 2021 23:08:50 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int main()
{
int m[105][105];
int n;
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>m[i][j];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
for(int k=1; k<=n; k++)
if(m[i][j]>0 and m[j][k]>0 and i!=j and j!=k and m[i][k]>m[i][j]+m[j][k]) m[i][k]=m[i][j]+m[j][k];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
fout<<m[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}