Cod sursa(job #559334)
Utilizator | Chitaru Vlad Florin vaduz | Data | 17 martie 2011 19:38:50 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream.h>
int main ()
{
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n,a[101][101],i,j,k;
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 ( a[i][k] && a[k][j] && (i!=j) && ( (a[i][k]+a[k][j]<a[i][j]) || !a[i][j] ) ) a[i][j]=a[i][k]+a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) g<<a[i][j]<<" ";
g<<'\n';
}
g.close();
return 0;
}