HDU-1196 Lowest Bit

Lowest Bit

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

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

   本题题意为输入一个整数，将该数转换为二进制，找到它不为0的最低位所代表的的数字大小。然后输出出来。

以下是本人所写的代码：

#include <iostream>
#include <cmath>
using namespace std;
int main(){
	int T,i;
	while(cin>>T){
		if(T==0) break;
		char a[8];
		for(i=0;i<8;i++){
			if(T%2==0) a[i]='0';
			else{
				a[i]='1';
				break;
			}
			T=T/2;
		}
		cout<<pow(2,i)<<endl;
	}
	return 0;
}