hdu 1196

Lowest Bit

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

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
  
  

 

Author

SHI, Xiaohan

 

Source

Zhejiang University Local Contest 2005

 

Recommend

Ignatius.L

 

#include <iostream>
using namespace std;
void ToBinary(int a)
{
	int i = 0, b[10] = {0};
	while(a)
	{
		b[i++] = a%2;
		a /= 2;
	}
	for (i = 0; i < 10; i++) 
		if(b[i]) break;
	cout<<(1<<i)<<endl;
}
int main()
{
	int n;
	while (cin>>n) 
	{
		if (n == 0) break;
		else ToBinary(n);
	}
	return 0;
}