hdu 1196 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

26 88 0

Sample Output

2 8

Author

SHI, Xiaohan

Source

Zhejiang University Local Contest 2005

代码如下：

#include<stdio.h>
int p(int k)
{
int ans=1,d=2;
while(k!=0)
{
if(k%2==1)
ans=ans*d;
k=k/2;
d=d*d;
}
return ans;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF&&n)
{
    int i=0;
    while(1)
    {
        if(n%2==0) {i++; n/=2;}
        else break;
    }
    //printf("i=%d n=%d\n",i,n);
    printf("%d\n",p(i));
}
return 0;
}