Cod sursa(job #1026414)
| Utilizator | Data | 11 noiembrie 2013 16:39:49 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int v[101][101],i,j,n,k;
int main()
{f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>v[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][k]*v[k][j]&&i!=j&&(v[i][k]+v[k][j]<v[i][j]||v[i][j]==0))
v[i][j]=v[i][k]+v[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<v[i][j]<<' ';
g<<'\n';}
return 0;
}
