首页 > 代码库 > HDU 2095 find your present (2)
HDU 2095 find your present (2)
HDU 2095 find your present (2)
题目描述：
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
32
use scanf to avoid Time Limit Exceeded
解题报告：
这道题利用异或就变得简单勒。利用以下的两个等式：
A^A=0
A^0=A
所以只要把输入的数字全部异或 那么留下来的就是奇数个的数字。
解题代码：
1 #include <stdio.h> 2 int main() 3 { 4 int a, n, b; 5 while(scanf("%d", &n), n) 6 { 7 a = 0; 8 while(n--) 9 { 10 scanf("%d", &b); 11 a ^= b; 12 } 13 printf("%d\n", a); 14 } 15 return 0; 16 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。