Lowest Bit

Description

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.

Input

Each line of input contains only an integer A (1 <= A <= 100). A line containing "0" indicates the end of input, and this line is not a part of the input data.

Output

For each A in the input, output a line containing only its lowest bit.

Sample Input

26
88
0

Sample Output

2
8


题目意思：我们知道十进制转化成二进制的方法，列如26，二进制则是11010，那么从后面开始算起只由第一位数是1的二进制是10，
其十进制则是2；同理88的
二进制则是1011000，从后面开始算起只由第一位数是1的二进制是1000，其十进制是8。

解题思路：要是直接从题目意思入手可以得到一下的代码：

#include<stdio.h>
#include<math.h>///类似十进制转换成二进制的原理，统计最后面的一个1之后0的个数
int lowest(int n)
{
    int x,count=0;
    while(n!=0)
    {
        x=n%2;
        if(x==0)
            count++;
        else
            break;///遇到非0就会退出
        n=n/2;

    }
    return count;
}
int main()
{
    int a,b;
    while(scanf("%d",&a)!=EOF)
    {
        if(a==0)
            break;
        b=pow(2,lowest(a));
        printf("%d
",b);

    }
    return 0;
}

其实还可以使用位运算的方法：

#include<stdio.h>///位运算的使用
int main()
{
    int n,m;
    while(scanf("%d",&n),n)
    {
         m=n&(n^(n-1));
         printf("%d
",m);
    }
    return 0;
}