Pagini recente » Cod sursa (job #1987719) | Cod sursa (job #1611915) | Cod sursa (job #3173958) | Cod sursa (job #1692683) | Cod sursa (job #1436604)
#include <fstream>
#define INF 1000000000
using namespace std;
int n, i, j, k, C[101][101], D[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main(){
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>C[i][j];
if(C[i][j] == 0){
C[i][j] = INF;
}else{
D[i][j] = i;
}
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(C[i][j] > C[i][k]+C[k][j] && i!=j){
C[i][j] = C[i][k]+C[k][j];
D[i][j] = D[k][j];
}
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(C[i][j] == INF){
fout<<0<<" ";
}else{
fout<<C[i][j]<<" ";
}
}
fout<<"\n";
}
}