Lowest Bit

最新推荐文章于 2017-07-23 14:57:16 发布

原创最新推荐文章于 2017-07-23 14:57:16 发布 · 593 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

15 篇文章

订阅专栏

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

#include <iostream>
using namespace std;
int main()
{
	int n,m;
	while (cin>>n&&n!=0)
	{
		m=1;
		while (n%2==0)
		{
			m=m*2;
			n=n/2;
		}
		cout<<m<<endl;	
	}
	return 0;
}