ZOJ Problem Set - 2417 Lowest Bit

Lowest Bit

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

---

Author: SHI, Xiaohan

Source: Zhejiang University Local Contest 2005    

分析：

题意：

给一个十进制数a要求输出a转换为二进制后它的最低位。如：26=11010（2），它的最低位是2；再如：88=1011000（2），它的最低位是8。有多组测试数据。

短除法模拟一下就知道怎么写代码了。

ac代码：

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;


int main()
{
    int n,num;
    while(scanf("%d",&n)&&n)
    {
        num=0;
        while(n%2==0)//用短除法试一下十进制转二进制就知道要怎么写代码了
        {
            n/=2;
            num++;
        }
        printf("%.lf\n",pow(2.0,num*1.0));//pow()函数输出的是double型（返回值是double型）
    }
    return 0;
}