1017: 牛人的题目(位运算一)Time Limit: 1000 MS Memory Limit: 4096 KB
Total Submit: 1318 Accepted: 526 Page View: 3562
Submit Status Discuss
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.
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.
For each case, output an integer in a line, which is the card number of your present.
5 1 1 3 2 2 3 1 2 1 0
题目意思就是说输入N个数,假设有且只有一个数只出现奇数次,那么请找出这个数并输出就OK了,很简单哈. 不过不要超时哦.这个题目还特意限制了Memory 的哦.