1116 Come on! Let's C（简单模拟)

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 (≤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.

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?

 /*
本题题意:
    给定一个数n, 接下来n行, 给定n个数 对应的排名(4位数 eg: 0001),
    并 1 - n行分别是对应id的排名.
    然后给一个数k，
    给出k行， 每行有一个需要搜查的id
本题思路：
    根据排名 有以下几种情况
    此id的排名是存在的
        排名没有被重复访问
            如果排名第一名
            如果排名的名次是质数
            如果有其他排名   
        排名被重复访问
    此id的排名已经不存在
*/

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxsize = 1e5 + 5;
int n, a[maxsize], visit[maxsize];
bool isPrime(int num){
	for(int i = 2; i <= (int)sqrt(num); i++){
		if(num % i == 0)
			return false;
	}
	return true;
}
void check(int id){
	if(a[id] > 0){
		if(visit[id] == false){
			if(a[id] == 1){
				printf("%04d: Mystery Award\n", id);
			}else if(isPrime(a[id])){
				printf("%04d: Minion\n", id);
			}else{
				printf("%04d: Chocolate\n", id);
			}
			visit[id] = true;
		}else{
			printf("%04d: Checked\n", id);
		}	
	}else if(a[id] == 0){
		printf("%04d: Are you kidding?\n", id);
	}
}
int main(){
	scanf("%d", &n);
	int id;
	for(int i = 1; i <= n; i++){
		scanf("%d", &id);
		a[id] = i;
	}
	int k;
	scanf("%d", &k);
	for(int i = 0; i < k; i++){
		scanf("%d", &id);
		check(id);
	}
	return 0;
}