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.
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>
#include <string.h>
int set(int n)
{
char str[10000];
int k = 0;
while(n)
{
int r = n%2;
str[k++] = r+'0';
n/=2;
}
str[k] = '\0';
int i;
for(i = 0;i<k;i++)
{
if(str[i]=='1')
break;
}
return i;
}
int pow(int n)
{
int s = 1;
for(int i = 1;i<=n;i++)
s*=2;
return s;
}
int main()
{
int n,k;
while(~scanf("%d",&n),n)
{
k = set(n);
k = pow(k);
printf("%d\n",k);
}
return 0;
}