Pagini recente » Cod sursa (job #347850) | Cod sursa (job #1555874) | Cod sursa (job #1307994) | Cod sursa (job #1134197) | Cod sursa (job #1558029)
#include <fstream>
#define MAX 10000
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,k,i,j,Gf[101][101],Ax[101][101];
int main()
{
cin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
cin>>Gf[i][j];
if(Gf[i][j]==0)
Gf[i][j]=MAX;
}
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
//if(Gf[i][j]==0&&i!=k&&j!=k&&i!=j)
Gf[i][j]=min(Gf[i][j],Gf[i][k]+Gf[k][j]);
for(i=1;i<=n;++i,cout<<'\n')
for(j=1;j<=n;++j)
if(Gf[i][j]==MAX||i==j)
cout<<"0 ";
else
cout<<Gf[i][j]<<' ';
return 0;
}