a[(height - 1 - j)*width + i]/(double)maxval; else s[] = 0.; } free (a); } else ... while (n < width*height && fscanf (p.fp, "%d ", &v) == 1) a[n++] = v; } ...
確定! 回上一頁