Cod sursa(job #539189)
| Utilizator | Data | 22 februarie 2011 16:34:45 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream.h>
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
long C[101][101],n,i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>C[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
if(C[i][k] > 0 && C[k][j] > 0 && (C[i][k] + C[k][j] < C[i][j] || C[i][j] ==0 ))
C[i][j] = C[i][k] + C[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<C[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}