产生模板 1(n)0(32 - n)
int rightnbitsone(int n)
{
int x = 0;
int y = 0x80000000;
(n > 0) && (n < 32) &&( x = (y >> n));
printf("the x is %x\n",x);
}
产生0(32-n-m)1(n) 0(m)
13 int onenandzerom(int n ,int m)
14 {
15 if (n < 0 | n >32 | m <0 | m >32)
16 {
17 printf("n and m is wrong!\n");
18 assert(0);
19 return 1;
20 }
21 unsigned int x;
22 x = (1 << n) -1;
23 x = (x << m);
24 printf("the x is %x\n",x);
25 }