2095 find your present (2)
来源:互联网 发布:澳门4g网络制式频段 编辑:程序博客网 时间:2024/06/12 21:49
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others)Total Submission(s): 15011 Accepted Submission(s): 5685
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
//思路:因为重复的号码都是复数的,所以用异或运算符即可得出只出现一次的那个号码#include<stdio.h>int main(){ int n,m,num; while(scanf("%d",&n),n) { num=0; while(n--) { scanf("%d",&m); num^=m; } printf("%d\n",num); }}
0 0
- hdu-2095-find your present (2)//1563-find your present
- 2095 find your present (2)
- 2095:find your present (2)
- 2095 find your present (2)
- find your present (2) 2095 *
- [2095]:find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present(2)
- find your present (2)
- find your present (2)
- find your present (2)
- find your present (2)
- 如何快速正确的安装 Ruby, Rails 运行环境
- AndroidManifest.xml文件解析
- Java多线程-工具篇-BlockingQueue
- Android Camera 使用小结
- POJ 1830 开关问题
- 2095 find your present (2)
- 九---内存管理2
- Mac及Android环境下的JNI学习
- 经纬财富:秦皇岛会议纪要平淡 白银高位震荡
- Java 内部类(分四种:成员内部类、局部内部类、静态内部类和匿名内部类)
- 2096 小明A+B
- 美女请25个国家的大神PS自己 你喜欢哪个国家的?
- 深入探索Java-HashSet和LinkedHashSet
- SSL与TLS的区别以及介绍