Mai intai trebuie sa te autentifici.
Cod sursa(job #328750)
| Utilizator | Data | 3 iulie 2009 12:11:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream.h>
#define MaxN 109
#define Inf 100009
int a[MaxN][MaxN],n;
void cit()
{
int i,j;
ifstream fin("royfloyd.in");
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fin>>a[i][j];
if(!a[i][j] && i!=j)
a[i][j]=Inf;
}
fin.close();
}
void roy_floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
void afis()
{
ofstream fout("royfloyd.out");
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<<'\n';
}
fout.close();
}
int main()
{
cit();
roy_floyd();
afis();
return 0;
}
