7K - find your present (2)

标签：return   end   des   --   diff   get   body   numbers   ber   

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 

Hint

use scanf to avoid Time Limit Exceeded

// 0^n=n, n^n=0. And "you can assume that only one number appear odd times"

 1 #include<stdio.h>
 2 int main()
 3 {
 4     int n, num, m;
 5     while(scanf("%d", &n), n)
 6     {
 7         m=0;
 8         while(n--)
 9         {
10             scanf("%d", &num);
11             m^=num;
12         }
13         printf("%d\n", m);
14     }
15     return 0;
16 }

View Code

7K - find your present (2)

标签：return   end   des   --   diff   get   body   numbers   ber   

原文地址：https://www.cnblogs.com/goldenretriever/p/10357106.html