题目链接:http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5493
题意&思路:
大水题不言不语。
源码:
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <map>
#define gmax(a,b) a>b?a:b
#define gmin(a,b) a<b?a:b
using namespace std;
int const MAXN = 1000+5;
int use[MAXN];
int findmax()
{
int t = 1;
for(int i=2; i<=1000; i++)
if(use[i]>use[t]) t=i;
return t;
}
bool repeat(int a)
{
for(int i=1; i<=1000; i++){
if(i==a) continue;
if(use[a]==use[i]) return true;
}
return false;
}
int main()
{
int t;scanf("%d",&t);
while(t--){
memset(use,0,sizeof(use));
int n,a;
scanf("%d",&n);
while(n--){
scanf("%d",&a);
use[a]++;
}
int t = findmax();
bool flag = repeat(t);
if(flag)
printf("Nobody\n");
else
printf("%d\n",t);
}
return 0;
}