Cod sursa(job #623585)
Utilizator | Data | 20 octombrie 2011 13:01:58 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
#define inf 0x3f3f3f3f
#include<algorithm>
using namespace std;
int a[101][101];
int n,i,j,k;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
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;
}
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
a[i][j]=min(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]<<" ";
else
g<<0<<" ";
g<<"\n";
}
}