页/行 | 误 | 正 |
17/-12 | 请重新看图1.2 | 请重新看图1.3 |
44/13 | "Good" | "Good " |
52/-4 | area6 | area7 |
52/-3 | area6 | area8 |
66/-7 | ++n; | n = n + 1; /* 程序不错,但当时未讲 ++ */ |
74/-13 | n的值是3 | n的值是4 |
82/10 | printf (...) | 其中的弯双引号应改为直双引号 |
86/-6-7 | for (...) | for (t = x, i = 1; i <= n; ++i) t *= - (x * x / (i*2) / (i*2 + 1)); |
90/-11 | for (fac = 1, i = 1; i < n; ++i) | for (fac = 1, i = 1; i <= n; ++i) |
110/13 | for (n = 0; n < 10, ++n) | for (n = 0; n < 10; ++n) |
129/-12 | 2 (公式里最后的指数) | 7 |
129/-7 | 1.3 2.4 1.35 2.46 (公式里) | 1·3 2·4 1·3·5 2·4·6 |
150/21 | extnumber | exnumber |
151/1 | 生存期 | 存在期 (目录中需相应修改) |
161/-4 | x - y | x * y |
185/19 | NUM(p)-1 | NUM-1 |
188/21 | 反应 | 反映 |
192/-13 | if (s[i] == 1) | if (s[i] == '1') |
196/1 | int getline(char line[], int limit) | int getline(int limit, char line[]) |
200/-6 | i < 5 | j < 5 |
225/-13 | p + 9 | p1 + 9 |
229/22 | char *p = s; | const char *p = s; |
232页图7.7 | /0 | \0 |
237/7 | printf(...); | printf("%s\n", argv[i]); |
239/14 | 下标为 1 | 下标为 i |
247/3 | usigned curnum, n; | unsigned curnum, n; |
280/21 | if (fscanf(...) ... | if (scanf(...) ... |
303/5 | amout | amount |
309/-7 | struct { int deg, mnt } degree; | struct { int deg, mnt; } degree; |
312/22,27 | (StuRec*)vp1->name (StuRec*)vp2->name | ((StuRec*)vp1)->name ((StuRec*)vp2)->name |
314/9 | c.re = r; | c.re = d; |
314/14-15 | Complex; c.re = r; | Complex c; c.re = n; |
356/22 | 那就声明... | 那就说明... |
361/13 | bool init(...) | int init(...) |
364/14 | "Commander: get file %s", line | "Commander: get a line\n%s\n", line |
364/15 | 检查函数名... | 检查文件名... |
感谢邓凡,沈军,韦灵南,夏壁灿等同仁,还有一些匿名读者提供的更正意见。
如发现书中其他错误,请与我联系。谢谢!
EMAIL:qzy@math.pku.edu.cn | 通讯地址:100871,北京大学数学学院信息科学系 |
2011.11.29 |