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. InputThe 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.OutputFor each case, output an integer in a line, which is the card number of your present.Sample 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.OutputFor 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 0Sample Output
3 2
这个题比较简单,可以有很多种做法,我做了之后去网上看了一下,发现了一种很霸气的方法,就是如下的代码。很巧妙的运用了按位异或的性质,高效的得出了答案。
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i,x,a;
while(~scanf("%d",&n)&&n)
{
x=0;
for(i=0;i<n;i++)
{
scanf("%d",&a);
x=x^a;
}
printf("%d\n",x);
}
return 0;
}
#include <stdlib.h>
int main()
{
int n,i,x,a;
while(~scanf("%d",&n)&&n)
{
x=0;
for(i=0;i<n;i++)
{
scanf("%d",&a);
x=x^a;
}
printf("%d\n",x);
}
return 0;
}