# 1116. Come on! Let’s C (20)-PAT甲级真题

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

1. The Champion will receive a “Mystery Award” (such as a BIG collection of students’ research papers…).
2. Those who ranked as a prime number will receive the best award — the Minions (小黄人)!
3. 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?

#### 分析

• 使用一个ran[10000]数组存储排名信息，ran[id]=i+1
• 使用一个集合set来判断当前id是否已经出现过
• 条件分支判断结果
#include
#include
#include

using namespace std;
int ran[10000];

bool isprime(int x) {
if(x<=1)
return false;
for (int i = 2; i <= sqrt(x); i++){
if(x%i==0)
return false;
}
return true;
}

int main() {
int num1, num2;
cin >> num1;
for (int i = 0; i < num1; i++) {
int id;
cin >> id;
ran[id] = i + 1;
}
cin >> num2;
set ss;
for (int i = 0; i < num2; i++) {
int id;
cin >> id;
printf("%04d: ", id);
if (ran[id] == 0) {
cout << "Are you kidding?" << endl;
continue;
}
if (ss.find(id) == ss.end()) {
ss.insert(id);
} else {
cout << "Checked" << endl;
continue;
}
if (ran[id] == 1) {
cout << "Mystery Award" << endl;
} else if (isprime(ran[id])) {
cout << "Minion" << endl;
} else {
cout << "Chocolate" << endl;
}
}
return 0;

}