二进制中1的个数

圆周率用acos(-1.0) 使用longlong

Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  LightOJ 1182  uDebug

Description

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

2

21

6

Sample Output

Case 1: odd

Case 2: even

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int t,k=1;	
	long long n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld",&n);
		printf("Case %d: ",k++);
		long long sum=0;
		while(n)
		{
			long long s=n%2;
			if(s==1)
		    sum++;
		    n=n/2;
		}
		if(sum%2==0)
		printf("even\n");
		else
		printf("odd\n");	
	}
	return 0;
}