ZOJ - 3869 Ace of Aces

原创 2018年04月15日 22:29:58

Problem Description

There is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not discovered yet. This year, the TSAB decided to elect an outstanding member from its elite troops. The elected guy will be honored with the title of “Ace of Aces”.

After voting, the TSAB received N valid tickets. On each ticket, there is a number Ai denoting the ID of a candidate. The candidate with the most tickets nominated will be elected as the “Ace of Aces”. If there are two or more candidates have the same number of nominations, no one will win.

Please write program to help TSAB determine who will be the “Ace of Aces”.

Input

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

The first line contains an integer N (1 <= N <= 1000). The next line contains N integers Ai (1 <= Ai <= 1000).

Output

For each test case, output the ID of the candidate who will be honored with “Ace of Aces”. If no one win the election, output “Nobody” (without quotes) instead.

Sample Input

3
5
2 2 2 1 1
5
1 1 2 2 3
1
998

Sample Output

2
Nobody
998

题解代码

#include<cstdio>
#include<cstring> 
int a[1005];
int book[1005];
int main()
{
    int n,m;
    scanf("%d",&n);
    while(n--){
        memset(book,0,sizeof(book));
        scanf("%d",&m);
        int num  = 0;
        for(int i = 1;i<=m;i++){
            scanf("%d",&a[i]);
            book[a[i]]++;
        }
        int max = 0;
        int flag = 0;
        int tool;
        for(int i = 1;i<=1000;i++){
            if(book[i]>max)
            {
                max = book[i];
                tool = i;
                flag = 0;
            }
            else if(book[i]==max)
            flag = 1;
        }
        if(flag==1)
        printf("Nobody\n");
        else
        printf("%d\n",tool);
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/AcmAres/article/details/79954441

ZOJ 3869 Ace of Aces

思路:找出现次数最多的那个数,如果有多个输出nobody #include using namespace std; int a[1001]; int T; int main() { ...
  • qq_21057881
  • qq_21057881
  • 2016-04-13 09:58:48
  • 411

ZOJ3869:Ace of Aces(浙江省赛2015)

The 12th Zhejiang Provincial Collegiate Programming Contest  There is a mysterious organization ca...
  • libin56842
  • libin56842
  • 2015-04-25 19:17:52
  • 1823

Ace of Aces ZOJ - 3869

寻找出现次数最多,如果有多个 输出Nobody//leehaoze #include #include #include #include #include #include #inclu...
  • lee_haoze
  • lee_haoze
  • 2017-04-16 20:33:05
  • 80

ZOJ 3869 -- Ace of Aces

Ace of Aces Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Submit Statu...
  • Inite
  • Inite
  • 2016-04-20 13:16:18
  • 189

ZOJ 3869 Ace of Aces

题意:给出一个个数为n的序列,求出其中的众数,若有多个众数,则输出Nobody 链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problem...
  • luminous11
  • luminous11
  • 2015-05-11 22:03:34
  • 260

zoj 3869 Ace of Aces

Ace of Aces Time Limit: 2 Seconds      Memory Limit: 65536 KB There is a mysterious organiz...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015-04-25 22:06:02
  • 354

ZOJ 3869:Ace of Aces【水】

Ace of Aces Time Limit: 2 Seconds      Memory Limit: 65536 KB There is a mysterious organizati...
  • lin14543
  • lin14543
  • 2016-05-09 20:03:13
  • 191

zoj 3869 Ace of Aces (水题)

There is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep univer...
  • qq_30591245
  • qq_30591245
  • 2017-04-30 11:39:40
  • 88

ZOJ - 3869 Ace of Aces (水)

ZOJ - 3869 Ace of Aces Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %...
  • yanghui07216
  • yanghui07216
  • 2016-05-01 15:12:28
  • 228

ZOJ Problem Set - 3869||Ace of Aces

Ace of Aces Time Limit: 2 Seconds      Memory Limit: 65536 KB There is a mysterious organizati...
  • Andrew_Ho
  • Andrew_Ho
  • 2015-04-26 21:29:57
  • 410
收藏助手
不良信息举报
您举报文章:ZOJ - 3869 Ace of Aces
举报原因:
原因补充:

(最多只允许输入30个字)