Hdoj 1196 Lowest Bit 【&】

最新推荐文章于 2018-10-07 13:30:39 发布

原创最新推荐文章于 2018-10-07 13:30:39 发布 · 743 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

水题专栏收录该内容

50 篇文章

订阅专栏

本篇博客介绍了一个简单的编程问题，即如何找出一个正整数转换为二进制后的最低位非零位，并提供了C++实现的示例代码。

Lowest Bit

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9273 Accepted Submission(s): 6824

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

题意：输出转换成二进制的非0位
代码：

#include <cstdio>
#include <iostream>
using namespace std;


int main(){
    int a;
    while(cin >>a, a){
        cout << (a&(-a)) <<endl;
    }
    return 0;
}