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

Author SHI, Xiaohan

Source Zhejiang University Local Contest 2005

Recommend Ignatius.L

#include<stdio.h>
#include<math.h>

int a[100]={0};

int TenToTwo(int n)
{
    int i=0;
    while(n)
    {
        a[i]=n%2;
        n=n/2;
        i++;
    }
    return i;
}

int TwoToTen(int *z, int n)
{
    int i=0,num=0;
    for(i=0;i<n;i++)
    {
        if((*z)==1)
        {
            num=num+(*z)*pow(2,i);
            return num;
        }
        z=z+1;
    }
    return num;
}

int main(void)
{
    int c=0,b=0;
    while(scanf("%d",&c),c!=0)
    {
        b=TenToTwo(c);
        printf("%d\n",TwoToTen(a,b));
    }
    return 0;
}