ACM Steps——find your present (2)

最新推荐文章于 2024-03-19 15:35:00 发布

乐此不疲的小忙

最新推荐文章于 2024-03-19 15:35:00 发布

阅读量134

点赞数

分类专栏： ACM 练习

本文链接：https://blog.csdn.net/qq_41713240/article/details/85217680

版权

ACM 同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

练习

4 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=2&problemid=11

find your present (2)

Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 9566 Accepted Submission(s): 2664

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.

Output

For each case, output an integer in a line, which is the card number of your present.

Sample Input

Sample Output

3
2

Hint

Hintuse scanf to avoid Time Limit Exceeded

Author

8600

Source

HDU 2007-Spring Programming Contest - Warm Up （1）

Recommend

8600

解法：两两异或找不同即可

源代码：

#include<stdio.h>
int main()
{
long long int n,a,temp;
while(~scanf("%lld",&n))
{
if(n==0)
return 0;
scanf("%lld",&a);
for(int i=0;i<n-1;i++)
{
scanf("%lld",&temp);
a = a^temp;
}
printf("%lld\n",a);
}
return 0;
}