HDU 2095 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): 15230 Accepted Submission(s): 5770



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

HintHint
use scanf to avoid Time Limit Exceeded

Author

8600

Source

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

Recommend

8600 | We have carefully selected several similar problems for you: 1593 1595 1599 1594 1598

Statistic | Submit | Discuss | Note

#include<stdio.h>
int main()
{
int n,m,s;
while(scanf("%d",&n)!=EOF&&n)
{
s=0;
while(n--)
{
scanf("%d",&m);
s^=m;
}
printf("%d\n",s);
}
return 0;
}

或者还有一种普通的做法：

#include<stdio.h>
#include<iostream>
#include<map>
using namespace std;
int main()
{
map<int,int> s;
int n;
while(scanf("%d",&n)&&n)
{
s.clear();
while(n--)
{
int x;
scanf("%d",&x);
s[x]++;
}
map<int,int>::iterator i;
for(i=s.begin();i!=s.end();i++)
{
if(i->second==1)
{
printf("%d\n",i->first);
}
}
}

return 0;

}