Cod sursa(job #1217127)
| Utilizator | Data | 6 august 2014 17:54:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int ma[102][102];
int n,i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
fin>>ma[i][j];
if(i!=j&&ma[i][j]==0)
{
ma[i][j]=1<<28;
}
}
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
if(ma[i][j]>ma[i][k]+ma[k][j])
ma[i][j]=ma[i][k]+ma[k][j];
}
for(i=1;i<=n;++i,fout<<'\n')
for(j=1;j<=n;++j)
if(ma[i][j]==1<<28)
fout<<"0 ";
else
fout<<ma[i][j]<<" ";
return 0;
}
