考的是73页整数除法向上舍入 int divide_power2(int x, int k) { int is_neg = x & INT_MIN; (is_neg && (x = x + (1 << k) - 1)); return x >> k; } int main() { printf("result = %d\n",divide_power
#include <stdio.h> int main(void) { int x =0x89ABCDEF; int y =0x76543210; int z =(x&0xFF)|((y>>8)<<8); printf("z=%x\n",z); } //x的最低有效字节形成一个掩码(x&0xFF) //书右上角页码29页,寻址和字节顺序中提到最低有