PAT甲级1116
来源:互联网 发布:mac的顿号怎么打 编辑:程序博客网 时间:2024/05/18 12:00
1116. Come on! Let's C (20)
"Let's C" is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of the contest is for fun, the award rules are funny as the following:
0. The Champion will receive a "Mystery Award" (such as a BIG collection of students' research papers...).
1. Those who ranked as a prime number will receive the best award -- the Minions (小黄人)!
2. Everyone else will receive chocolates.
Given the final ranklist and a sequence of contestant ID's, you are supposed to tell the corresponding awards.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=10000), the total number of contestants. Then N lines of the ranklist follow, each in order gives a contestant's ID (a 4-digit number). After the ranklist, there is a positive integer K followed by K query ID's.
Output Specification:
For each query, print in a line "ID: award" where the award is "Mystery Award", or "Minion", or "Chocolate". If the ID is not in the ranklist, print "Are you kidding?" instead. If the ID has been checked before, print "ID: Checked".
Sample Input:61111666688881234555500016888800011111222288882222Sample Output:
8888: Minion0001: Chocolate1111: Mystery Award2222: Are you kidding?8888: Checked2222: Are you kidding?
#include<cstdio>#include<algorithm>#include<vector>using namespace std;const int maxn = 10000+10;int N, K;vector<int> v;bool flag[maxn] = { false };bool isPrime(int x){if (x < 2)return false;int sq = sqrt(x);for (int i = 2; i <= sq; i++){if (x%i == 0)return false;}return true;}bool find(int x,int &index){for (int i = 0; i < N; i++){if (v[i] == x){index = i;return true;}}return false;}int main(){scanf("%d", &N);int t;for (int i = 0; i < N; i++){scanf("%d", &t);v.push_back(t);}scanf("%d", &K);int index = -1;for (int i = 0; i < K; i++){scanf("%d", &t);if (find(t,index)){if (!flag[index]){flag[index] = true;if (index == 0){printf("%04d: Mystery Award\n", t);}else if (index != 0){if (isPrime(index + 1)){printf("%04d: Minion\n", t);}elseprintf("%04d: Chocolate\n", t);}}elseprintf("%04d: Checked\n",t);}elseprintf("%04d: Are you kidding?\n",t);}return 0;}
- PAT甲级1116
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- PAT(甲级)1015
- PAT(甲级)1016
- OpenCV26(c++风格的标定程序)
- python基础
- js 获取元素所有兄弟节点实例
- 用 Lua 实现一个微型虚拟机-基本篇
- struts2中跳转页面中不执行jquery mobile页面中的$(function()
- PAT甲级1116
- Hrbust 1545
- python函数
- 每日170215
- AngularJs模块加载 配置块
- css的鼠标手势大全
- 混合应用开发框架Cordova源码学习总结
- C++:在成员函数后面放const的作用
- 链表之单链表重复元素的删除