#include <iostream>
#include <vector>
#include <math.h>
#include <set>
using namespace std;
bool primeNumber(int a){
int i,k;
k=(int)sqrt(a);
for(i=2;i<=k;i++){
if(a%i==0){
break;
}
}
return i>k;
}
int main(){
int N,num,K;
int rank[10001]={0};
vector<int> queryNum;
set<int> querySet;
cin>>N;
for(int i=0;i<N;i++){
cin>>num;
rank[num]=i+1;
}
cin>>K;
for(int i=0;i<K;i++){
cin>>num;
queryNum.push_back(num);
}
for(int i=0;i<K;i++){
num=queryNum[i];
if(rank[num]==0){
printf("%04d: Are you kidding?\n",num);
}else if(querySet.count(num)==1){
printf("%04d: Checked\n",num);
}else if(querySet.count(num)==0){
querySet.insert(num);
if(rank[num]==1){
printf("%04d: Mystery Award\n",num);
}else if(primeNumber(rank[num])){
printf("%04d: Minion\n",num);
}else{
printf("%04d: Chocolate\n",num);
}
}
}
return 0;
}
PAT乙级 C语言竞赛
最新推荐文章于 2022-11-11 14:19:36 发布