首页 > 代码库 > find your present (2)
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.
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
use scanf to avoid Time Limit Exceeded题目内存限制：1024K，所以不能简单地用数组存然后再处理。
为了节约内存，可以用STL里面的set,map等容器。
当容器里没有这个元素的时候，就插入这个元素，否则，删除这个元素。
最后，容器中肯定只剩下一个元素，便是我们所要的结果。
1 #include <set> 2 #include <stdio.h> 3 using namespace std; 4 5 int main(){ 6 int n; 7 int i; 8 int temp; 9 set<int> S;10 11 while(1){12 scanf("%d",&n);13 14 if(n==0)15 break;16 17 for(i=0;i<n;i++){18 scanf("%d",&temp);19 20 if(S.find(temp)==S.end())21 S.insert(temp);22 23 else24 S.erase(temp);25 }26 27 printf("%d\n",*S.begin());28 S.clear();29 }30 31 return 0;32 }
find your present (2)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。