hdu 2095 find your present (2) 找到只出现一次的数字
来源:互联网 发布:方便面 知乎 编辑:程序博客网 时间:2024/04/30 03:43
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)Total Submission(s): 15349 Accepted Submission(s): 5821
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
51 1 3 2 231 2 10
Sample Output
32
数据有点水, 不符合要求的都是成对出现,所以有人用位运算^给A了
我是用map做, 之前还想排序下搞,发现内存限制,,,, 1024*1024 / 4=262144 无法满足要存的10^6
所以,只能map了.
#include <stdio.h>#include <algorithm>#include <map>using namespace std;int main(){int n,i,a;map<int,int>my;map<int,int>::iterator it;while(scanf("%d",&n),n){for(i=0;i<n;i++) {scanf("%d",&a);my[a]++;}for(it=my.begin();it!=my.end();it++){if(it->second==1){printf("%d\n",it->first);break;}}my.clear();}return 0;}
0 0
- hdu 2095 find your present (2) 找到只出现一次的数字
- (HDUSTEP 2) hdu 2095 find your present (2)(找到出现奇数次的那个数)
- hdu-2095-find your present (2)//1563-find your present
- HDU 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present(2)
- hdu 2095 find your present (2)
- hdu 2095 find your present (2)
- HDU 2095--Find your present (2) 【set】
- hdu 2095 find your present (2)
- HDU 2095 find your present (2)
- hdu 2095 find your present (2)
- Android短彩信数据库解析
- hdu 3183
- 360极速浏览器对于z-index的特殊处理方式
- cocos2dx 定义全局变量(C++)
- 如何让Activity背景透明
- hdu 2095 find your present (2) 找到只出现一次的数字
- Hibernate_12_HQL语句查询
- 那目不转睛的气味 - 最佳香水女性必看
- java Calendar详解
- CSS中class之间的空格
- 把github上下载的项目导入到自己的Gerrit中
- SQL OPENQUERY用法
- Flex preloader 引用swf文件
- 那总是在时尚经典的服装风格