HDOJ find your present (2) 2095
来源:互联网 发布:迅雷5.8绿色优化版 编辑:程序博客网 时间:2024/06/05 16:52
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17902 Accepted Submission(s): 6859
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
32use scanf to avoid Time Limit ExceededHintHint
Author
8600
Source
HDU 2007-Spring Programming Contest - Warm Up (1)
Recommend
8600 | We have carefully selected several similar problems for you: 2094 1597 1593 2098 1595
异或的性质
- 交换律:a ^ b = b ^ a
- 结合律:a ^ b ^ c = a ^ (b ^ c) = (a ^ b) ^ c
- d = a ^ b ^ c 可以推出 a = d ^ b ^ c
- 自反性:a ^ b ^ a = b
运用自反性。
#include<stdio.h>#include<algorithm>using namespace std;int main(){int t;while(scanf("%d",&t),t){int res=0;int a;while(t--){scanf("%d",&a);res=res^a;//}printf("%d\n",res);}return 0;}
0 0
- HDOJ 2095 find your present (2)
- hdoj 2095 find your present (2)
- hdoj.2095 find your present (2) 20140804
- hdoj 2095 find your present (2)
- HDOJ 2095 find your present (2)
- HDOJ find your present (2) 2095
- HDOJ 2095 find your present (2)
- HDOJ 2095-find your present (2)
- HDOJ 2095 find your present (2)
- HDOJ 2095 find your present (2)
- hdoj 1563 Find your present!&&2095 Find your present(2) 异或运算
- hdoj 2095 find your present (2) 【位运算】
- hdoj-2095-find your present (2)【位异或】
- HDOJ 2095 find your present (2) 位运算
- hdoj 2095 find your present (2)【位运算,异或】
- HDOJ 2095 Find your present (2) 异或运算
- hdoj 2095 find your present (2)(异或运算)
- 异或的性质 HDOJ 2095 find your present (2)
- 深入理解:Android 编译系统
- linux中的正则表达式
- C语言指针学习六
- EditText电话号码格式
- 关系模式的规范化
- HDOJ find your present (2) 2095
- Java学习篇之---JNI简单实现(续)
- 嵌入式软件开发培训笔记——Java第三天(方法重载、对象的构造与初始化过程分析、封装等)
- Qt杂项笔记
- Simple Android Java & JavaScript Bridge
- 数据链路层组播报文接收问题
- Android性能优化典范(二)
- 导航栏遮盖住部分View的解析
- Java解惑精炼版(一)