Pagini recente » Cod sursa (job #1685596) | Cod sursa (job #2354066) | Cod sursa (job #1618040) | Cod sursa (job #242364) | Cod sursa (job #2683150)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int nmax=100;
int d[nmax+1][nmax+1];
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
fin>>d[i][j];
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i!=j&&d[i][k]!=0&&d[k][j]!=0){
if(d[i][j]>d[i][k]+d[k][j]||d[i][j]==0){
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
fout<<d[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}