Bit Problem

题目描述

As everyone knows, any non-zero integer’s binary representation, must have at least one bit of the data 1, XiaoMing process whom wants to know if a binary representation of the rightmost 1 can change to 0, How much is this number will reduce.

But now, XiaoMing, busy job, no time to YY this question, so as ACMer your duty bound to help him solve this problem.

 

输入

Input consists of several cases, For each case, the first input is an integer N, then with N lines thar each integer is non zero integer. N=0 indicates the end of the input.

 

输出

For each set of case, we need to output N data corresponding to each row of data representation, the corresponding data in the most the 1 change 0, again resulting from the difference between the results with the original data. Each data finally output a blank line.

 

示例输入

2
9
3

5
19999
456
10000000
1
8

0

示例输出

Answer to case1:
1
1

Answer to case2:
1
8
128
1
8

//题意：求一个数转化为二进制，在最右边的1改为0，变化之后得到的数减少了多少

//标程：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
//	freopen("a.txt","r",stdin);
	int cnt(0), n, i, x;
	int flag(0);
    while(cin >> n && n)
	{
		cnt ++;
		if(flag == 1) cout << endl;
		printf("Answer to case%d:\n",cnt);
		flag = 1;
		for(i = 1; i <= n; i ++)
		{
			cin >> x;
			int j = 0, ans = 1, k;
			while(x)
			{
                                k = x % 2;
				if(k == 1) break;
                                ans *= 2;
				x /= 2;
				
			}
		    cout << ans << endl;
		}
	}
	return 0;
}