hdu-oj 1196 Lowest Bit

Lowest Bit

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

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
  
  
  
  

   
    
  
  
  
  

   
   题目大意：把一个数转换为2进制后，从低位开始至遇到‘1’，然后将其转换为10进制；
  
  
  
  

   
   附代码：
  
  
  
  

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