hdoj 1196 Lowest Bit

http://acm.hdu.edu.cn/showproblem.php?pid=1196

 

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7684    Accepted Submission(s): 5641

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,i,j,a[]={1,2,4,8,16,32,64,128,256};//100的二进制数是 1100100
    while(scanf("%d",&A)&&A!=0)
    {
         for(i=0;;i++)
         {
              if(A%2==1)break;
              A=A/2;
         } 
         printf("%d\n",a[i]);
    }
    return 0;
}