Cod sursa(job #390707)
| Utilizator | Data | 4 februarie 2010 13:11:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream.h>
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,k,n,a[1001][1001];
void drum()
{
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];
}
int main()
{fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
fin>>a[i][j];
drum();
for (i=1;i<=n;i++)
{ for (j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
fout.close();
return 0;
}