Cod sursa(job #2776141)
Utilizator | Enal Gemaledin Blaugranas | Data | 18 septembrie 2021 18:35:18 |
---|---|---|---|
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");
short d[100][100],n,i,j,k;
int main()
{
F>>n;
for(i=0;i<n;++i)
for(j=0;j<n;++j)
F>>d[i][j];
for(k=0;k<n;++k)
for(i=0;i<n;++i)
for(j=0;j<n;++j)
if(i!=j&&d[i][k]&&d[k][j]&&(!d[i][j]||d[i][j]>d[i][k]+d[k][j]))
d[i][j]=d[i][k]+d[k][j];
for(i=0;i<n;++i) {
for(j=0;j<n;++j)
G<<d[i][j]<<" ";
G<<"\n";
}
return 0;
}