HDU 1196

Lowest Bit

[align=left]Problem Description[/align]
Given an positive integer A (1 <= A <= 100), output the lowest bit of A.

For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.

Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8.

化成二进制，把最后一个1往后的都取出来输出；其实就相当是这个数能被多少个2整除。

再次我就基本位运算了。

#include<stdio.h>
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
int sum=1;
while(n==(n>>1)<<1)
{
n>>=1;
sum<<=1;
}
printf("%d\n",sum);
}
return 0;
}