Lowest Bit

Lowest Bit

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

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 "iostream"
#include "cmath" 
using namespace std;
int main()
{
	int n;
	while(cin>>n&&n)
	{
		int i=0;
		while(n/2)
		{
		    int m=n%2;
			if(m)//找到最先的1，结束循环 
				break;
			n=n/2; 
			i++;	
		}
		cout<<pow(2,i)<<endl;
	}
	return 0;
} 

别人的代码（不太懂怎么实现的）：

#include<stdio.h>
int main()
{	int a;
   	while(scanf("%d",&a),a)
	   printf("%d\n",a&(-a)); 
	return 0;
}