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
  
  
  
  

   
    
  
  
  
  

   
   解题分析：
  
  
  
  

   
       对于本道题，第一思路就是采用位运算，否则可能会超时间。
  
  
  
  

   
     方法一：
  
  
  
  

   
         直接return  a&(-a)
  
  
  
  

   
          解释：比如  26
  
  
  
  

   
              它的二进制位：  0000000000011010 
  
  
  
  

   
           而-26的二进制位：  1111111111100110       &之后，就将最后低位的1给保留了
  
  
  
  

   
     方法二：
  
  
  
  

   
            如果a的最低位是0；则a&1=0；是1，a&1==1；以此来找到最低位的1,找一次，是0的话，sum++,a>>=1;；之后利用函数pow(2,sum)得出！
  
  
  
  

   
    
  
  
  
  
   
   
   
/*#include<stdio.h>
 int main()
    {
    	int a;
    	  while(scanf("%d",&a),a)
    	    {
    	    	printf("%d\n",a&(-a));
    	    }
    	return 0;
    }
*/
#include<stdio.h>
#include<cmath>
  int main()
    {
    	int a;
    	int i,j;
		double sum;
    	while(scanf("%d",&a),a)
    	  {
    	  	 sum=0;
    	  	while(1)
    	  	  {
    	  	  	  if((a&1)==0)
    	  	     {
    	  	   	    sum++;
    	  	      	a>>=1;
    	  	     }
    	      	 else
			       break;
    	  	  }
    	  	
    	  	   
    	  	printf("%.0lf\n",pow(2,sum));
    	  }
    	  return 0;
    }