Pagini recente » Cod sursa (job #2065567) | Cod sursa (job #933915) | Cod sursa (job #2689228) | Cod sursa (job #567534) | Cod sursa (job #2929105)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int INF=1e7+1,N=101;
int a[N][N],minDist[N][N];
int main()
{
int n,i,j,k;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
cin>>a[i][j];
if(a[i][j]==0)
a[i][j]=INF;
minDist[i][j]=a[i][j];
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(minDist[i][j]>minDist[i][k]+minDist[k][j])
minDist[i][j]=minDist[i][k]+minDist[k][j];
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
if(i==j)
cout<<"0 ";
else
cout<<minDist[i][j]<<" ";
cout<<'\n';
}
return 0;
}