Lowest Bit

Lowest Bit

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 34   Accepted Submission(s) : 17

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

 

 

Author

SHI, Xiaohan

 

 

Source

Zhejiang University Local Contest 2005

 

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main()
{
    int num,sign,i,j,k,K,sum;
    char num_2[8],NUM_2[8];
    while(1)
    {
        scanf("%d",&num);
        if(num==0)break;
        itoa(num,num_2,2);
        sign=strlen(num_2);
        for(i=sign-1,j=1;i>=0;i--)
        {
            if(num_2[i]!='1')
            {
                NUM_2[j]='0';
                j++;
            }
            else
            {
                NUM_2[0]='1';
                NUM_2[j]='\0';
                break;

            }
        }
        k=strlen(NUM_2);
        for(i=1,sum=1;i<k;i++)
        {
            sum*=2;
        }
        printf("%d\n",sum);

    }
    return 0;
}