hdoj 2095 find your present (2)(异或运算)
来源:互联网 发布:国家顶级域名汇总 编辑:程序博客网 时间:2024/04/28 16:30
find your present (2)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20083 Accepted Submission(s): 7824
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: 2097 2094 1008 1597 1593
异或运算
n^n=0;
0^n=n;
a^b=b^a;
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int n,m;while(scanf("%d",&n),n){int x=0;int i;for(i=0;i<n;i++){scanf("%d",&m);x^=m;}printf("%d\n",x);}return 0;}
0 0
- 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) 异或运算
- Find your present!(异或运算)
- hdoj-2095-find your present (2)【位异或】
- 异或的性质 HDOJ 2095 find your present (2)
- HDU - 2095 find your present (2) 异或运算
- hdoj problem 1563 Find your present!(位运算(异或运算求特殊数))
- HDOJ题目2095find your present (2)(数学,异或消除)
- hdoj 2095 find your present (2) 【位运算】
- HDOJ 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) (位异或)
- HDOJ 2095 find your present (2)
- hdoj 2095 find your present (2)
- zend Studio快捷键操作说明
- 时间选择器机获取上边时间
- windows phone应用程序生命周期
- [安卓开发工具]
- LoopBanner 一个支持自动播放和循环滚动的banner控件
- hdoj 2095 find your present (2)(异或运算)
- oracle数据库知识点整理
- Python安装Scrapy
- Sublime
- 初学Redis(2)——用Redis作为Mysql数据库的缓存
- 2.8 Android 产品统计 报表 好用的“友盟”
- jquery 对 Json 的各种遍历
- javascript二维数组遍历
- 线程间的通信 iOS