杭电 HDU 1196 Lowest Bit

最新推荐文章于 2021-03-14 21:40:01 发布

研发之道

最新推荐文章于 2021-03-14 21:40:01 发布

阅读量896

点赞数

分类专栏： acm水题题解文章标签： acm c++ 杭电算法编程

未来百科AI导航：https://www.huntagi.com

本文链接：https://blog.csdn.net/lsgqjh/article/details/44736577

版权

acm水题题解专栏收录该内容

131 篇文章 0 订阅

订阅专栏

Lowest Bit

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

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

Sample Output

2
8

Author

SHI, Xiaohan

水得要命啊

大晚上的草

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int a;
	while(cin>>a,a)
	{int count=0;
        while(a%2==0)
		{count++;
			a/=2;
		}
		cout<<pow(2,count)<<endl;
	}
	return 0;
}