Cod sursa(job #275628)
| Utilizator | Data | 10 martie 2009 16:27:26 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],i,j,k,n;
int main ()
{
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) f>>a[i][j];
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (i!=k && j!=k && i!=j) if (a[i][j]>a[i][k]+a[k][j]) a[i][j]=a[i][k]+a[k][j];
for (i=1;i<=n;i++)
{if (i!=1) g<<'\n';
for (j=1;j<=n;j++) g<<a[i][j]<<" ";
}
return 0;
}
