HDU-2095-find your present (2)-位或/STL（set）

标签：exce   turn   class   mit   you   because   scanf   each   case   

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

5
1 1 3 2 2
3
1 2 1
0

Sample Output

3
2


        
 
use scanf to avoid Time Limit Exceeded

Hint

Hint
        
 

HDU-2095-find your present (2)-位或/STL（set）

标签：exce   turn   class   mit   you   because   scanf   each   case   

原文地址：https://www.cnblogs.com/OFSHK/p/11252837.html