HDU 1196 Lowest Bit （水）

ACResume

于 2012-05-29 14:58:44 发布

阅读量664

点赞数

CC 4.0 BY-SA版权

文章标签： output input integer each

本文链接：https://blog.youkuaiyun.com/ACResume/article/details/7612809

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Problem 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

#include <stdio.h>

int main(){
    int a,ans;
    while(~scanf("%d",&a),a){
        ans=1;
        while(!(a&1)){
            a>>=1;
            ans<<=1;
        }
        printf("%d\n",ans);
    }
    return 0;
}