1116. Come on! Let's C (20)
来源:互联网 发布:遥感数据融合方法 编辑:程序博客网 时间:2024/05/21 03:26
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 <cstdlib>#include <algorithm>#include <cstring>using namespace std;typedef long long int ll;struct Node{int res;int flag;Node(){res = flag = 0;}};Node Rank[10005];int prime[10005];void Prime(){for(int i=0; i<=10000; i++)prime[i] = 1;prime[0] = prime[1] = 0;for(int i=2; i<=10000; i++){if(prime[i]){for(int j=2*i; j<=10000; j+=i)prime[j] = 0;}}}int main(){Prime();int count = 0;int N;scanf("%d",&N);int ID;for(int i=1; i<=N; i++){scanf("%d",&ID);Rank[ID].res = ++count;}int K;scanf("%d",&K);for(int i=1; i<=K; i++){scanf("%d",&ID);if(Rank[ID].res==0)printf("%04d: Are you kidding?\n",ID);else if(prime[Rank[ID].res]){if(Rank[ID].flag == 0){printf("%04d: Minion\n",ID);Rank[ID].flag = 1;}elseprintf("%04d: Checked\n",ID);}else if(Rank[ID].res==1){if(Rank[ID].flag==0){printf("%04d: Mystery Award\n",ID);Rank[ID].flag = 1;}elseprintf("%04d: Checked\n",ID);}else{if(Rank[ID].flag==0){printf("%04d: Chocolate\n",ID);Rank[ID].flag = 1;}elseprintf("%04d: Checked\n",ID);}}return 0;}
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C
- PAT--1116. Come on! Let's C
- PAT 1116. Come on! Let's C
- 1116. Come on! Let's C
- 【PAT】1116. Come on! Let's C
- 1116. Come on! Let's C 解析
- pat 1116. Come on! Let's C
- solution Of 1116. Come on! Let's C (20)
- 玩转【斗鱼直播APP】系列之实现无限轮播
- iOS应用程序的生命周期
- 基于Qualcomm8909对于SDIO的识别过程解析
- (完全转载)@RequestMapping的全部用法(貌似是全部的?一共6、7种)
- libcurl库返回状态码解释与速查
- 1116. Come on! Let's C (20)
- 玩转【斗鱼直播APP】系列之游戏推荐展示
- [rootfs] InitRamdisk & InitRamfs 介绍和使用
- 从装饰者模式到Context类族
- HDU 1130 How Many Trees?
- Leetcode 74 Search a 2D Matrix
- maven打包上传源码
- 二分图的最大匹配、完美匹配和匈牙利算法
- jquery 手机号验证码倒计时