ID 在很多数中间出现次数为奇数的数

最新推荐文章于 2022-02-19 08:58:01 发布

蝉鸣的夏季

最新推荐文章于 2022-02-19 08:58:01 发布

阅读量307

点赞数

分类专栏： ACM-模拟文章标签： ACM

本文链接：https://blog.csdn.net/qqchanmingdexiaji/article/details/53571789

版权

ACM-模拟专栏收录该内容

23 篇文章 0 订阅

订阅专栏

It is very cold in Harbin in the winter, but it is pretty warm in the Zhengxin Building. Today is Saturday, Teacher ABG want to play a trick on the only one student called NWL because he didn’t finish the MOOC.

At the beginning, every student is in the building. The teacher calls some students to sweep the snow on the playground out of the building, and sometimes he also call some students who are on the playground back to the building. At last, teacher ABG wants to leave only one student, NWL, on the playground out of the building. It means that the teacher ABG calls NWL’s ID ODD times, but called other students’ ID EVEN times, maybe more than twice. Now give you the list describing the students’ ID which the teacher called in order, please tell us NWL’s ID.

Input

The first line is an integer T, describes the number of tests. Then T tests.

In each test, the first line is an integer N, describes the number of IDs on the list.

Then followed N lines, each line contains an integer M, describes one ID on the list.

Output

T lines. Each line, an integer, the NWL’s ID.

Sample Input

Sample Output

1140310000
1140310002
1

Hint

1<=T<=10

1<=N<=1,000,000

1<=M<=1,159,999,999

说给你很多数，让你找出出现次数为奇数的那个数，而且已经告诉你只有一个人数出现的次数为奇数。

将输入的所有数字异或起来（^）就是答案。因为a^a=0 , 0^a=a

#include<iostream>
#include<cstdio>
#include<ctime>
#include<cstdlib>
using namespace std;

int m,t;
int n;
int ans;

int main()
{
scanf("%d",&t);
while(t--){
ans=0;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&n);
ans^=n;
}
cout<<ans<<'\n';
}
return 0;
}