hdu1196 Lowest Bit

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

26880

 

Sample Output

28

 

Author

SHI, Xiaohan

C语言AC代码

#include<stdio.h>int main(){    int a,i,k,s,answer;    while(scanf("%d",&a)&&a)    {        s=0;        answer=1;        while(a)        {            k=a%2;            if(k==1)            {                for(i=0;i<s;i++)                    answer=answer*2;                printf("%d\n",answer);                a=0;            }            a=a/2;            s++;        }    }    return 0;}