Cod sursa(job #275642)
| Utilizator | Data | 10 martie 2009 16:31:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream.h>
#include<fstream.h>
int v[101][101],n,i,j;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void roy()
{
int i,j,k;
for (k=0;k<n;k++)
for (i=0;i<n;i++)
for (j=0;j<n;j++)
if (v[i][k] && v[k][j] && (v[i][j]>v[i][k]+v[k][j] || !v[i][j]) && i!=j)
v[i][j]=v[i][k]+v[k][j];
}
int main ()
{
f>>n;
for (i=0;i<n;i++)
for (j=0;j<n;j++) f>>v[i][j];
roy();
for (i=0;i<n;i++)
{if (i) g<<'\n';
for (j=0;j<n;j++) g<<v[i][j]<<" ";}
f.close();
g.close();
return 0;
}