hdoj 1196 Lowest Bit (二进制)

Lowest Bit

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

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
  
  

 

题意：截取末位至第一个为1 的数，计算大小。

题解：二进制性质： a & ( 2^j) 为真,  第j为就是1(以0位开始)

代码：

#include<cstdio>
int main()
{
	int a,m;
	while(scanf("%d",&a),a)
	{
		for(int i=0;i<10;i++)
		{
			if(a&(1<<i))
			{
				m=1<<i;	
				break;	
			}			
		}
		printf("%d\n",m);
	}
	return 0;
}