ZOJ3860: Find the Spy

ZOJ3860: Find the Spy

Whoooa! There is a spy in Marjar University. All we know is that the spy has a special ID card. Please find him out!

Input

There are multiple test cases. The first line of input contains an integerTIndicating the number of test cases. For each test case:

The first line contains a integerN(3 <=N<= 100), which describes that there areNStudents need to be checked.

The second line containsNIntegers indicating the ID card numberNStudents. All ID card numbers are 32-bit integers.

Output

For each test case, output the ID card number which is different from others.

Sample Input

3101 1 1 1 1 1 1 1 6 139 9 8590016 90016 90016 2009 90016

Sample Output

682009

Sign-in question not explained

#include 
 
  #include 
  
   #include 
   
    #include 
    
     #include 
     
      #include
      #include 
       
        #include 
        
         #include 
         
          #include using namespace std;#define ls 2*i#define rs 2*i+1#define up(i,x,y) for(i=x;i<=y;i++)#define down(i,x,y) for(i=x;i>=y;i--)#define mem(a,x) memset(a,x,sizeof(a))#define w(a) while(a)#define LL long longconst double pi = acos(-1.0);#define Len 100005#define mod 1000000007int t,n,a[105];int main(){ int i; scanf("%d",&t); w(t--) { scanf("%d",&n); up(i,0,n-1) { scanf("%d",&a[i]); } sort(a,a+n); if(a[0]==a[1]) printf("%d\n",a[n-1]); else printf("%d\n",a[0]); } return 0;}