求个关于位的算法

[一如当初]

要求去掉某位，比如十进制147，转换为二进制为10010011
算法要求去掉中间的1（红色部分），二进制变为1000011，转换为十进制为67

最终也就是147->67

[老猫]

#include <stdio.h> 
int main()
{
   int in, i, out=0, k = 1;
   scanf("%d", &in);
   scanf("%d", &i);
   while (in>0)
   {
		if (i!=0)
		{
			out = out  + k * (in % 2) ;
			k=k*2 ;
		}
		in = in / 2;
		i--;
   }
   printf("%d  ",out);
   return 0;
}

[marsliu1984]

#define bit(x) (1<<(x)) int clrbit(int number, int n) { number = (number & (~bit(n))); return number; } int main(void) { int in, i, out=0, k = 1; scanf("%d", &in); scanf("%d", &i); clrbit(in,i); printf("%d\n",in); return 0; }

[marsliu1984]

#define bit(x)   (1<<(x))

int clrbit(int number, int n)
{
       number = (number & (~bit(n)));
     return number;
}

int main(void)
{
        int in, i;
       scanf("%d", &in);
      scanf("%d", &i);
   in = clrbit(in,i);
printf("%d\n",in);
return 0;
}

[赵4老师]

((147>>1)&0x70)|(147&0x0F)