2005. Lovely Number
Constraints
Time Limit: 1 secs, Memory Limit: 64 MB
Description
Every time after got a solution from kevin, ivan repeats again and again,"Are there any better ones?". It seems more worse this time. Given a sequence of numbers, which ivan is sure that all of them appear even times except only one "lovely number" appears odd times, kevin must find out the lovely number as soon as possible. So, let's rock!
Input
There are multiple test cases.
Each test case contains two lines. The first line is an integer N, 1 <= N <= 10001, and N % 2 = 1. The second line contains N integers, separated by spaces.
Input is terminated by EOF.
Output
For each test case, output a line of an integer, which should be the lovely number.
Sample Input
3
1 2 1
5
7 7 7 7 3
7
2 2 4 4 4 2 2
Sample Output
2
3
4
Problem Source
2010中山大学新手赛-网络预选赛 ivankevin@argo
此题与前面一题相似,利用异或操作符。
// Problem#: 2005
// Submission#: 1983081
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int n;
while(scanf("%d",&n)!=EOF){
int a=0,temp,i;
for(i=0;i<n;i++){
cin>>temp;
a^=temp;
}
cout<<a<<endl;
}
return 0;
}