Lowest Bit
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11304 Accepted Submission(s): 8277
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
这是道很有意思的水题,如果模拟当然就是水过了,有一个方法就是
n&(-n) 即可输出结果,为什么呢?
现在我们来证明
假设n表示为二进制数 0001010100
则-n在的二进制表示为
11110101100 因为在计算机中二进制以补码的形式给出,前面补符号位
所以很容易就看出,n&(-n)的结果即是所得。
#include<iostream>
using namespace std;
int main()
{
int x;
while(cin>>x,x)
cout<<(x&(-x))<<endl;
}