Cod sursa(job #605661)
| Utilizator | Data | 1 august 2011 16:15:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[200][200],i,j,k,n,INF=INT_MAX;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{f>>a[i][j];
if (a[i][j]==0&&i!=j) a[i][j]=INF;
}
f.close();
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]<a[i][j]&&i!=k&&j!=k)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if (a[i][j]<INF) g<<a[i][j]<<" ";
g<<"\n";
}
g.close();
return 0;
}
