HDoj-2095-与众不同
2017-04-27 15:42
267 查看
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'scard number will be the one that different from all the others.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<=200, and n is odd) at first. Following that, n positive integers will be given in a line. 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
#include<stdio.h> int main() { int T; int n,m; while(~scanf("%d",&T),T){ scanf("%d",&n); while(--T){ scanf("%d",&m); n=m^n; } printf("%d\n",n); } return 0; }
[/code]
相关文章推荐
- HDoj-2095-与众不同
- HDOJ2095 find your present (2)
- [热身题][hdoj_2095]find your present (2)
- HDOJ 2095 find your present (2)
- HDOJ 2095-find your present (2)
- hdoj 2095 find your present (2)【位运算,异或】
- hdoj 2095 find your present (2)
- hdoj-2095-Linearization of the kernel functions in SVM
- hdoj 2095
- HDOJ 2095 find your present (2)
- HDOJ2095
- 杭电OJ(HDOJ)2095题:find your present (2)(数论)
- HDOJ 2095(找出唯一的出现一次的数)
- 与众不同 【杭电-2095】 附题
- hdoj_2095_Find your present (2) (位异或)
- hdoj 2095 find your present (2) 【位运算】
- HDOJ 2095 find your present (2) 位运算
- HDOJ 2095 find your present (2)
- HDOJ 2095 Find your present (2) 异或运算
- hdoj 2095 find your present (2)