Lowest Bit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9076 Accepted Submission(s): 6677
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<math.h>
int a[50],b[50];
int main()
{
int n,i,j,sum;
int weishu;
while(scanf("%d",&n)&&(n!=0))
{
weishu=1;
while(n)
{
a[weishu++]=n%2;
n/=2;
}
sum=0;
for(i=1;i<weishu;i++)
{
if(a[i])
{
sum+=pow(2,i-1);
break;
}
}
printf("%d\n",sum);
}
return 0;
}