杭电2095

最新推荐文章于 2020-12-20 02:14:02 发布

1planet

最新推荐文章于 2020-12-20 02:14:02 发布

阅读量202

点赞数

分类专栏： c语言基础

本文链接：https://blog.csdn.net/qq_42239440/article/details/100062841

版权

c语言基础专栏收录该内容

19 篇文章 1 订阅

订阅专栏

find your present (2)

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 32589 Accepted Submission(s): 12642

Problem Description

In the new year party, everybody will get a "special present".Now it's your turn to get your special present, a lot of presents now putting on the desk, and only one of them will be yours.Each present has a card number on it, and your present's card number will be the one that different from all the others, and you can assume that only one number appear odd times.For example, there are 5 present, and their card numbers are 1, 2, 3, 2, 1.so your present will be the one with the card number of 3, because 3 is the number that different from all the others.

Input

The input file will consist of several cases.
Each case will be presented by an integer n (1<=n<1000000, and n is odd) at first. Following that, n positive integers will be given in a line, all integers will smaller than 2^31. These numbers indicate the card numbers of the presents.n = 0 ends the input.

Output

For each case, output an integer in a line, which is the card number of your present.

Sample Input

1 1 3 2 2

1 2 1 0

Sample Output

3 2

#include <iostream>
using namespace std;
int main()
{
	int c,x;
	while(~scanf("%d",&c),c)
	{
		int a=0;
		for(int i=1;i<=c;i++){
			scanf("%d",&x);
			a^=x;//按位异或运算
		}
		printf("%d\n",a);
	}
	return 0;
}