Find the Spy

Find the SpyTime Limit: 2 SecondsMemory Limit: 65536 KBWhoooa! 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 integerT indicating the number of test cases. For each test case:The first line contains a integer N (3 <= N <= 100), which describes that there areN students need to be checked.The second line contains N integers indicating the ID card number ofN students. 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

3
10
1 1 1 1 1 1 1 1 6 1
3
9 9 8
5
90016 90016 90016 2009 90016

6

8

2009

#include<stdio.h>int a[105];

int main(){int t,i,n,j;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=0; i<n; i++){scanf("%d",&a[i]);}for(i=0; i<n; i++)//只考虑前三个数的关系{if(a[0]==a[1]){for(j=i+1; j<n; j++){if(a[j]!=a[0]){printf("%d\n",a[j]);break;}}}if(a[0]!=a[1]&&a[0]!=a[2]){printf("%d\n",a[0]);break;}if(a[0]==a[2]&&a[0]!=a[1]){for(j=i+1; j<n; j++){if(a[j]!=a[0]){printf("%d\n",a[j]);break;}}}break;}}return 0;}

Author: DAI, LongaoSource: The 15th Zhejiang University Programming Contest