hdu 2076 find your present (2)

find your present (2)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/1024 K (Java/Others)
Total Submission(s): 15190    Accepted Submission(s): 5754

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

  
  

   
   5
1 1 3 2 2
3
1 2 1
0
  
  

 

Sample Output

  
  

   
   3
2


   
   

    
    

     
     Hint
    
    
Hint
   
   
   
    
use scanf to avoid Time Limit Exceeded
  
  

 

题目数据很大，一不注意就超时了，sort排序不行，学的别人的--异或

present出现的次数一定是1次也就是奇数次，而题目每组数据也是奇数个，那个其他非present一定出现了偶数次。

a^a=0

a^0=a

异或满足交换律，相同的两个数亦或为0，任何数和0亦或为其本身。这样就可以解决了。。。

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main()
{
    int n;
    int ans;
    int x;
    while (scanf("%d",&n) && n)
    {
        ans=0;
        for (int i=0; i<n; i++)
        {
            scanf("%d",&x);
            ans^=x;
        }
        printf("%d\n",ans);
    }
    return 0;
}