Pagini recente » Cod sursa (job #2105421) | Cod sursa (job #990575) | Istoria paginii runda/simulareoji_2005_11-12/clasament | Cod sursa (job #508103) | Cod sursa (job #793641)
Cod sursa(job #793641)
#include <stdio.h>
#include <stdlib.h>
int main() {
int n, i, j, k;
int *mpond;
int *mcost;
FILE *fis;
fis = fopen("royfloyd.in", "rt");
fscanf(fis, "%i", &n);
mpond = (int*)malloc(sizeof(int)*n*n);
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++)
fscanf(fis, "%i", mpond + i*n+j);
}
fclose(fis);
for(k = 0; k < n; k++)
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
if(*(mpond+i*n+k) + *(mpond+k*n+j) < *(mpond+i*n+j))
*(mpond+i*n+j) = *(mpond+i*n+k) + *(mpond+k*n+j);
fis = fopen("royfloyd.out", "wt");
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++)
fprintf(fis, "%i ", *(mpond+i*n+j));
fprintf(fis, "\n");
}
fclose(fis);
free(mpond);
return 0;
}