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

 

Answer

 

#include <iostream>
#include <cmath>
using namespace std;
int binary(int n)
{
 int i,k=0,a[100];
 while(n)
 {
  a[k++]=n%2;
  n/=2;
 }
 for(i=0;i<k;i++)
  if(a[i])
   break;
 return i;  
}
int main()
{
 int n,x;
 while(cin>>n,n)
 {
  x=binary(n);
  cout<<pow(2,x)<<endl;
 }
 return 0;
}