LIGHT OJ-1182 - Parity 【按位与】

1182 - Parity

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

Given an integer n, first we represent it in binary. Then we count the number of ones. We say n has odd parity if the number of one's is odd. Otherwise we say n has even parity. 21 = (10101)₂ has odd parity since the number of one's is 3. 6 = (110)₂ has even parity.

Now you are given n, we have to say whether n has even or odd parity.

Input

Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case contains an integer n (1 ≤ n < 2³¹).

Output

For each case, print the case number and 'odd' if n has odd parity, otherwise print 'even'.

Sample Input	Output for Sample Input
2 21 6	Case 1: odd Case 2: even

 

题意：判断n的二进制中1的个数

思路：和1按位与，每次取出最后的一个数直到取完为止；

AC代码：

#include<cstdio>

int main()
{
	int T,N,Kase=0;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&N);
		int cnt=0;
		while(N)
		{
			if(N&1) cnt++;
			N>>=1;
		}
		printf("Case %d: ",++Kase);
		if(cnt&1)
		printf("odd\n");
		else printf("even\n");
	}
	return 0;
}