hdu1196 Lowest Bit

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 <stdlib.h>
#include<string.h>
#include <stdio.h>
int main()
{    
      int n,i,k,l,a[15]={0};
      char s[15];
      while(scanf("%d",&n)&&n)
      {     
            itoa(n,s,2);                     //进制转换的函数，特简单
           //printf("%s\n",s);
           for(i=strlen(s)-1;i>=0;i--)
           if(s[i]=='1')
           {

                 l=strlen(s)-i;
                 break;

           }
           k=1;
           for(i=0;i<l-1;i++)
          k=k*2;
          printf("%d\n",k);
      }   
return 0;
}