HDU-2095-find your present (2)-位或/STL（set）

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.

InputThe 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.OutputFor 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
 
use scanf to avoid Time Limit Exceeded

Hint

Hint
 
题意：
　　给出n，说明有n个数字，要求找出一个与其他数字不同的那个数，只有需要找的那个数字出现过奇数次，其他都是偶数次。
法一：
这是用容器写的，用了set
s.find(x)!=s.end() 说明找到了 
s.erase(x); 找到和它一样的就把它删掉 
s.insert(x); 没有找到就把这个数字插入
需要注意的是：题目说了，找到的那个数字是奇数个，而其他数字都是偶数个，所以可以利用set，否则要是我们需要找3，给出一组数据2、2、2、3像这样是找不出来的。

 #include<iostream>
 #include<iomanip>
 #include<string.h>
 #include<set>
 #define inf 0x3f3f3f3f
 using namespace std;
 
 int main()
 {
     std::ios::sync_with_stdio(false);
     cin.tie();
     cout.tie();
     int n;
     while(cin>>n)
     {
         if(n==)
             break;
         set<int>s;
         s.clear();
         int x;
         for(int i=;i<n;i++)
         {
             cin>>x;
             if(s.find(x)!=s.end())//找到了
                 s.erase(x);//删掉
             else//没有找到
                 s.insert(x);
         }
         cout<<*s.begin()<<endl;
     }
     return ;
 }

法二：
利用位运算

 #include<iostream>
 #include<iomanip>
 #include<string.h>
 #include<set>
 #define inf 0x3f3f3f3f
 using namespace std;
 
 int main()
 {
     std::ios::sync_with_stdio(false);
     cin.tie();
     cout.tie();
     int n;
     while(cin>>n)
     {
         if(n==)
             break;
         int x=;//0和任何非0数m异或都为0;
         for(int i=;i<n;i++)
         {
             int ss;
             cin>>ss;
             x=x^ss;
         }
         cout<<x<<endl;
     }
     return ;
 }