hdu 2095

find your present (2)

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

51 1 3 2 231 2 10

 

Sample Output

32

Hint

Hint

use scanf to avoid Time Limit Exceeded

 

Author

8600

 

Source

HDU 2007-Spring Programming Contest - Warm Up （1） 

/*
分析：给你n个数（n为偶数），然后找出只出现过一次的数，即找出出现奇数次的数。 
      这时候根据异或的特性，可以快速找出那个数。 
*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <vector>
using namespace std;
int main(void)
{
	int n;
	while(scanf("%d",&n)!=EOF,n)
	{
		int sum=0;
		int x;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&x);
			sum^=x;
		}
		printf("%d\n",sum);
	}
	return 0;
}