hdoj 1196 位运算

                               Lowest Bit

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

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，所以呀！

直接循环取二的模，如果为0则记录sum加一，否则break；

然后就是循环乘二，也可以在判断里面直接乘二

 

ac代码：

#include<stdio.h>
#include<string.h>
int main()
{
	int n,s,t;
	while(~scanf("%d",&n),n)
	{
		s=1;
		while(n)
		{
			if(n%2==1) break;
			s*=2;
			n/=2;
		}
		printf("%d\n",s);
	}
	return 0;
} 

另辟蹊径的ac代码（位运算）：

#include<stdio.h>
int main()
{
    
	int A,a[16],i;
    while(scanf("%d",&A),A!=0)
    {
		int k=0,sum=1;
		for(i=15;i>=0;i--)
		  a[i]=(A&1<<i?1:0);
		  for(i=0;i<=15;i++)
		   {if(!a[i])
		   k++;
		   else
		   break;}
		   for(i=0;i<k;i++)
		   sum*=2;
		   printf("%d\n",sum);
	}
    return 0;
}

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