ZOJ - 3869 Ace of Aces (水)
2016-05-01 15:12
621 查看
ZOJ - 3869
Ace of Aces
SubmitStatus
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".
<h4< body="">
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).
<h4< body="">
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.
<h4< body="">
Sample Input
<h4< body="">
Sample Output
Hint
Source
The 12th Zhejiang Provincial Collegiate Programming Contest
//题意:
找出出现次数最多的数,如果有多个输出Nobody
Ace of Aces
Time Limit: 2000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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".
<h4< body="">
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).
<h4< body="">
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.
<h4< body="">
Sample Input
3 5 2 2 2 1 1 5 1 1 2 2 3 1 998
<h4< body="">
Sample Output
2 Nobody 998
Hint
Source
The 12th Zhejiang Provincial Collegiate Programming Contest
//题意:
找出出现次数最多的数,如果有多个输出Nobody
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> using namespace std; const int MAXN = 1010; int num[MAXN]; int p[MAXN]; int main(){ int T, N; scanf("%d", &T); while(T--){ memset(num, 0, sizeof(num)); memset(p, 0, sizeof(p)); scanf("%d", &N); int x; for(int i = 0; i < N; i++){ scanf("%d", &x); num[x]++; } int ans = 0, temp = 0; for(int i = 0; i < MAXN; i++){ if(num[i] >= temp){ temp = num[i]; ans = i; p[temp]++; } } if(p[num[ans]] > 1){ puts("Nobody"); } else printf("%d\n", ans); } return 0; }
相关文章推荐
- vs中如何统计整个项目的代码行数
- vs中如何统计整个项目的代码行数
- jstl中<c:forEach>的用法
- 全国SHP地图数据赠送
- linux Xtrabackup安装及使用方法
- 唱吧-利用HTML5漏洞免费导出MV
- 毕设笔记--SSH前台JSP页面下拉列表框的值从数据库动态获取
- avformat_find_stream_info接口延迟降低
- OC学习笔记(2)——@class指令
- 深入浅出Nodejs
- 【1】引用计数基本知识
- JavaScript的对象属性的两种访问方式
- 如何控制线程执行的先后顺序
- <img src> 和 background-image 区别
- Android之XmlSerializer生成xml文件
- CentOS服务器ntpdate同步
- [drp 4] 使用dom4j,读取XML数据,保存至数据库
- [drp 4] 使用dom4j,读取XML数据,保存至数据库
- Apache使用mod_jk/mod_proxy模块实现代理、负载均衡的配置
- VLC架构及流程分析