1116 Come on! Let's C (20)

标签：enc   final   mys   ram   spec   test   wing   search   amp   

"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:

6
1111
6666
8888
1234
5555
0001
6
8888
0001
1111
2222
8888
2222

Sample Output:

8888: Minion
0001: Chocolate
1111: Mystery Award
2222: Are you kidding?
8888: Checked
2222: Are you kidding?

题目大意：给出一张名次表，第一名的奖品是mystery award， 名次是素数的奖品是minion，其他名次的奖品是chocolate；现在查询某个人的奖品。如果这个人不存在输出are you kidding? 如果已经查询过了，则输出checked，其他情况下输出对应的奖品

思路：由题目知道，对于某个人查询，由三种状态：不存在，存在未查询过， 存在查询过。那么用一个数组来记录每一个人的状态分别用-1，0， 1来表示这三种状态； 再用一个数组来记录每个人的名次；

1116 Come on! Let's C (20)

标签：enc   final   mys   ram   spec   test   wing   search   amp   

原文地址：https://www.cnblogs.com/mr-stn/p/9160898.html