Pagini recente » Cod sursa (job #3171269) | Cod sursa (job #2299751) | Cod sursa (job #1121784) | Cod sursa (job #1512206) | Cod sursa (job #2211051)
#include <iostream>
#include <stdio.h>
using namespace std;
int m[200][200];
int main() {
FILE *fin, *fout;
int i, j, k, n;
fin = fopen("rf.in", "r");
fout = fopen("rf.out", "w");
fscanf(fin,"%d", &n);
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fscanf(fin,"%d", &m[i][j]);
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(i!=j&&j!=k&&i!=k&&m[i][j]>m[i][k]+m[k][j])
m[i][j]=m[i][k]+m[k][j];
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(m[i][j]==2000000000)
m[i][j]=0;
fprintf(fout,"%d ", m[i][j]);
}
fprintf(fout,"\n");
}
fclose(fin);
fclose(fout);
return 0;
}