周赛

最新推荐文章于 2019-11-10 11:27:12 发布

Oenheng

最新推荐文章于 2019-11-10 11:27:12 发布

阅读量249

点赞数

分类专栏：小数学文章标签：小数学

本文链接：https://blog.csdn.net/oenheng/article/details/52316410

版权

小数学专栏收录该内容

16 篇文章 0 订阅

订阅专栏

圆周率用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)2 has odd parity since the number of one's is 3. 6 = (110)2 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 < 231).

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

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