Cod sursa(job #1211284)
Utilizator | Data | 22 iulie 2014 12:09:57 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
long a[101][101],i,j,k,n;
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)
if(i!=k)
for(j=1;j<=n;++j)
if( (a[i][k]!=0 && a[k][j]!=0 && j!=k && a[i][j]>a[i][k]+a[k][j]) || (a[i][j]==0 && j!=i)) 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";
}
f.close();
g.close();
return 0;
}