Lowest Bit（hdoj1196）

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

点我

  把n化为二进制数，然后找出最低位，例如101000 最低位为1000 为8， 

 #include<cstdio>
 #include<iostream>
 #include<cmath>
 using namespace std;
 int fen(int n)
 {
     int i,a;
     for(i=;n!=;i++)
     {
         a=n%;
         if(a!=)
         {
             return i;
         }
         else
             n=n/;
     }
 }
 int main()
 {
     int n,i;
     while(cin>>n)
     {
         if(n==)
             break;
         else
             cout<<pow(,fen(n))<<endl;

     }
 }