ZOJ2417&&HDU1196-Lowest Bit

最新推荐文章于 2017-11-11 18:45:25 发布

Wang_128

最新推荐文章于 2017-11-11 18:45:25 发布

阅读量244

点赞数

CC 4.0 BY-SA版权

分类专栏： ZOJ ----水题 ----其他 HDU

本文链接：https://blog.youkuaiyun.com/a664607530/article/details/70243379

HDU 同时被 3 个专栏收录

490 篇文章

订阅专栏

----水题

234 篇文章

订阅专栏

----其他

216 篇文章

订阅专栏

本文介绍了一个简单的程序设计问题，即如何找出给定正整数的二进制表示中最低位的1所对应的数值。通过使用位运算技巧，文章提供了一种简洁高效的解决方案，并附带示例输入输出帮助理解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Lowest Bit

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

题意：输出二进制最低位的1

解题思路：直接用lowbit

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <functional>
#include <bitset>
#include <string>

using namespace std;

#define LL long long
#define INF 0x3f3f3f3f

int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        printf("%d\n",n&(-n));
    }
    return 0;
}