find your present (2)(初识异或)
2017-11-09 15:58
253 查看
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
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
5 1 1 3 2 2 3 1 2 1 0
Sample Output
3 2 use scanf to avoid Time Limit Exceeded
#include<stdio.h> int main() { int n,x,a,i; while(1) { scanf("%d",&n); if(n==0) return 0; else { x=0; for(i=0;i<n;i++) { scanf("%d",&a); x=x^a; } printf("%d\n",x); } } return 0; }
相关文章推荐
- 【基础训练-异或的运用】find your present
- 杭电 2095 find your present (2)【位运算 异或】
- *寒假水71——find your present (2) 【位运算~异或(^)】
- Find your present!(异或运算)
- find your present (2) (位异或)
- hdu 2095 find your present (2)(位异或)
- find your present (2) v【 异或运算的巧用】
- find your present (2)(按位异或)
- HDU 2095 find your present (2) 【异或】
- HDOJ2095 ( find your present (2) ) 【异或运算】
- HDU 2095 find your present (2) 异或
- hdu - 2095 - find your present (2)(异或)
- ACM--steps-dyx--1.2.3--find your present (2)(异或)
- HDU-2095 find your present (2) 按位异或求解
- HDU 2095 Find your present (2) (位异或)
- 【菜鸟做水题】:杭电 find your present(用异或的解题思想)
- hdu 1563简单异或Find your present!
- hdoj_2095_Find your present (2) (位异或)
- HDU 2095 find your present (2) 异或的经典运用
- hdoj 1563 Find your present!&&2095 Find your present(2) 异或运算