HDOJ 5038 Grade
来源:互联网 发布:网络卖淫产业链 编辑:程序博客网 时间:2024/06/03 13:18
Grade
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 194 Accepted Submission(s): 105
Problem Description
Ted is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the weight of a mushroom is w, then it’s grade s is
s = 10000 - (100 - w)^2
What’s more, Ted also has to report the mode of the grade of these mushrooms. The mode is the value that appears most often. Mode may not be unique. If not all the value are the same but the frequencies of them are the same, there is no mode.
What’s more, Ted also has to report the mode of the grade of these mushrooms. The mode is the value that appears most often. Mode may not be unique. If not all the value are the same but the frequencies of them are the same, there is no mode.
Input
The first line of the input contains an integer T, denoting the number of testcases. Then T test cases follow.
The first line of each test cases contains one integers N (1<=N<=10^6),denoting the number of the mushroom.
The second line contains N integers, denoting the weight of each mushroom. The weight is greater than 0, and less than 200.
The first line of each test cases contains one integers N (1<=N<=10^6),denoting the number of the mushroom.
The second line contains N integers, denoting the weight of each mushroom. The weight is greater than 0, and less than 200.
Output
For each test case, output 2 lines.
The first line contains "Case #x:", where x is the case number (starting from 1)
The second line contains the mode of the grade of the given mushrooms. If there exists multiple modes, output them in ascending order. If there exists no mode, output “Bad Mushroom”.
The first line contains "Case #x:", where x is the case number (starting from 1)
The second line contains the mode of the grade of the given mushrooms. If there exists multiple modes, output them in ascending order. If there exists no mode, output “Bad Mushroom”.
Sample Input
36100 100 100 99 98 1016100 100 100 99 99 1016100 100 98 99 99 97
Sample Output
Case #1:10000Case #2:Bad MushroomCase #3:9999 10000
Source
2014 ACM/ICPC Asia Regional Beijing Online
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <map>#include <vector>#include <set>using namespace std;int getS(int x){ return 10000-(100-x)*(100-x);}int main(){ int T_T,cas=1; scanf("%d",&T_T); while(T_T--) { map<int,int> mp; int n,mx=-1; scanf("%d",&n); for(int i=0;i<n;i++) { int x; scanf("%d",&x); x=getS(x); mp[x]++; mx=max(mp[x],mx); } map<int,int>::iterator it; vector<int> ans; set<int> st; bool flag=true; for(it=mp.begin();it!=mp.end();it++) { if(it->second==mx) { ans.push_back(it->first); st.insert(it->first); } else { flag=false; } } printf("Case #%d:\n",cas++); if(flag) { if(st.size()==1) flag=false; else puts("Bad Mushroom"); } if(flag==false) { sort(ans.begin(),ans.end()); for(int i=0,sz=ans.size();i<sz;i++) { if(i) putchar(32); printf("%d",ans[i]); } putchar(10); } } return 0;}
1 3
- HDOJ 5038 Grade
- HDOJ 5038 Grade
- hdoj 5038 Grade【众数】
- HDOJ 5038 Grade (模拟)
- hdoj 1084 What Is Your Grade?
- hdoj 1084 What Is Your Grade?
- hdoj 1084 What Is Your Grade?
- HDOJ 1084 What Is Your Grade?
- HDOJ 1084 What Is Your Grade?
- HDOJ 1084 What Is Your Grade?
- HDOJ HDU 1084 What Is Your Grade?
- HDU 5038 Grade
- HDU - 5038 Grade
- [ACM] hdu 5038 Grade
- hdu 5038 Grade(水题)
- hdu 5038 Grade
- HDU 5038 Grade
- HDU 5038Grade
- 2015年网易校招Java开发工程师(技术架构)在线笔试题(2015年9月20日 18:00—20:00)
- HDOJ 5019 Revenge of GCD
- Apk调试过程细节
- 【面试】经典面试题,你会做几道(持续更新)
- HDU 1839 Delay Constrained Maximum Capacity Path
- HDOJ 5038 Grade
- 唯品会2015校园招聘技术岗附加题解答
- Java垃圾收集器与内存分配策略
- Codeforces Round #268 (Div. 2)
- execv使用
- Java之父 James Gosling 发表博文 《Too Soon》纪念乔布斯。
- oracle ebs hrms 接口程序
- CoreOS宣布收购Quay.io并启动了CoreOS企业Registry
- 功能键与键盘自定义优先级冲突