# 题目

“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 (≤10^4)$, 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.

# 题解

## 思路

• 憨憨题
• 读取所有人和排名，添加到哈希表里
• 遍历每次查询，按照是否是素数，是否检查过，是否是第一名的原则来输出
• 查询后将其添加到checked中

## 数据结构

• rank 是一个哈希表，将id映射到排名
• checked 是一个哈希集，记录已经查询过的人的id

## 算法

• 如何判断是否是素数
• 先判断1,2,3的情况
• 如果数能被2整除，那么不是素数
• 步长为2遍历从3到sqrt(原数)
• 当原数能被这个遍历着的数整除的时候，说明它不是素数
• 都能整除说明它是素数
• 这个算法相对复杂度小一点。

## 代码

• 由于使用Python可以AC，因此只放了Python的题解。