Cod sursa(job #402890)
| Utilizator | Data | 24 februarie 2010 11:41:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#define MaxN 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[MaxN][MaxN],i,j,k,n;
int main()
{ fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
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]>a[i][k]+a[k][j]||!a[i][j])&&i!=j)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
}