hdu 1196 Lowest Bit

<pre class="html" name="code">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 n;

     while(scanf("%d",&n)&&n!=0)

    {

         printf("%d\n",n&(-n));

    }

 return 0;

}

这个使用位运算得出的结果，挺简单的

#include<stdio.h>
int main()
{
   // int a[10];
   int a,s;
   while(scanf("%d",&a)&&a!=0)
   {
     // int ;
     s=1;
      for(;a>0;a/=2)
      {
         if(a%2==0)
         s*=2;
         else break;
      }
      printf("%d\n",s);
   }
  return 0;  
}

这是我第一次见这个题的时候的思路，这两个都AC啦