Pagini recente » Monitorul de evaluare | Borderou de evaluare (job #3333448) | Borderou de evaluare (job #1470132) | Cod sursa (job #2541237)
#include <stdio.h>
const int INF = 1e9;
const int nmax = 100;
int dp[nmax][nmax];
int main()
{
FILE *fin, *fout;
int n,i,j,k;
fin = fopen("royfloyd.in","r");
fout = fopen("royfloyd.out","w");
fscanf(fin,"%d",&n);
for(i=0; i<n; i++)
for(j=0; j<n; j++){
fscanf(fin,"%d",&dp[i][j]);
if(dp[i][j] == 0 && i != j)
dp[i][j] = INF;
}
for(k=0; k<n; k++)
for(i=0; i<n; i++)
for(j=0; j<n; j++)
if(dp[i][k] + dp[k][j] < dp[i][j])
dp[i][j] = dp[i][k] + dp[k][j];
for(i=0; i<n; i++){
for(j=0; j<n; j++)
fprintf(fout,"%d ",dp[i][j]);
fprintf(fout,"\n");
}
fclose(fin);
fclose(fout);
return 0;
}