ACM--steps-dyx--1.2.3--find your present (2)(异或)
来源:互联网 发布:游戏中常用算法 编辑:程序博客网 时间:2024/05/16 17:30
find your present (2)
Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6568 Accepted Submission(s): 1682Problem 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
#include<iostream>#include<cstdio>using namespace std;int main(){ int n; while(cin>>n&&n) { int num; int ans=0; while(n--) { //异或的性质。 //a^b^a=b; cin>>num; ans^=num; } cout<<ans<<endl; } return 0;}
0 0
- ACM--steps-dyx--1.2.3--find your present (2)(异或)
- ACM--steps--dyx--1.2.2--
- find your present (2)(初识异或)
- Find your present!(异或运算)
- find your present (2)(按位异或)
- HDU 2095 Find your present (2) (位异或)
- hdu 2095 find your present (2)(位异或)
- hdu - 2095 - find your present (2)(异或)
- hdu2095 find your present (2)(异或)
- hdoj 2095 find your present (2)(异或运算)
- find your present (2) (位异或)
- HDU 2095 find your present (2) (位异或)
- ACM--steps--dyx--1.2.1
- hdoj 1563 Find your present!&&2095 Find your present(2) 异或运算
- ACM STEP 1.2.4 find your present (2)
- ACM——find your present (2)
- 杭电 acm find your present (2)
- 【ACM解题报告】Find Your Present 2
- spring使用title2或title3
- LeetCode OJ Scramble String
- LeetCode OJ Find Minimum in Rotated Sorted Array II
- vb.net机房收费系统重构——配置文件
- C# OPC客户端远程连接RSLinx OPC服务器
- ACM--steps-dyx--1.2.3--find your present (2)(异或)
- centOS 5.8下,手动将静态ip修改为动态ip
- Java中只有按值传递,没有按引用传递!
- VC 多线程编程
- LeetCode OJ Trapping Rain Water
- hdu4267分组线段树
- LeetCode OJ Insert Interval
- leetcode Excel Sheet Column Number
- PAINTSTRUCT结构