Pagini recente » Cod sursa (job #2401077) | Cod sursa (job #2474925) | Istoria paginii utilizator/adastanisor | Cod sursa (job #1770007) | Cod sursa (job #2009085)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,m,i,j,k,c,x,y,nr;
int D[101][101];
int main(){
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>D[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(D[i][j]==0)
D[i][j]=1001;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
if(i!=k)
for(j=1;j<=n;j++)
if(i!=j && D[i][j]>D[i][k]+D[k][j])
D[i][j]=D[i][k]+D[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
if(D[i][j]==1001)
fout<<"0 ";
else
fout<<D[i][j]<<" ";
fout<<"\n";
}
return 0;
}