Mai intai trebuie sa te autentifici.
Cod sursa(job #2343518)
| Utilizator | Data | 14 februarie 2019 08:19:18 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <fstream>
#define MAX 110
#define INF INT_MAX
using namespace std;
ifstream fin("royfloyd.in");
fstream fout("royfloyd.out");
int a[MAX][MAX],n;
void citire();
void rf();
void afisare();
int main()
{
citire();
rf();
afisare();
return 0;
}
void citire()
{
int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=INF;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
}
void rf()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(k!=i&&k!=j&&i!=j)
{
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
}
void afisare()
{
int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
if(a[i][j]==INF)
fout<<0<<' ';
else
fout<<a[i][j]<<' ';
fout<<endl;
}
}
