Pagini recente » Cod sursa (job #2423301) | Cod sursa (job #2407061) | Cod sursa (job #3138726) | Cod sursa (job #3225054) | Cod sursa (job #406308)
Cod sursa(job #406308)
#include <cstdio>
const int MAX=101,INF=100000000;
int way[MAX][MAX],n;
inline int min(int a,int b){
return (a<b)?a:b;
}
int main(){
FILE* fin=fopen("royfloyd.in","r");
FILE* fout=fopen("royfloyd.out","w");
fscanf(fin,"%u",&n);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
fscanf(fin,"%u",&way[i][j]);
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
if(way[i][j]&&way[i][k]&&way[k][j]){
way[i][j]=min(way[i][j],way[i][k]+way[k][j]);
}
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
fprintf(fout,"%u ",way[i][j]);
}
fputc('\n',fout);
}
return 0;
}