A1116 Come on! Let's C (20 分)

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 10010; 
int N, K;
int Rank[maxn];
int checked[maxn];
int isPrime(int x){
	if(x <= 1) return 0;
	int sqr = (int)sqrt(x*1.0);
	for(int i = 2; i <= sqr; i++){
		if(x%i == 0) return 0; 
	} 
	return 1;
}
int main() {
	memset(Rank, -1, sizeof(Rank));	
	memset(checked, 0, sizeof(checked));	
	scanf("%d", &N);
	int id;
	for(int i = 1; i <= N; i++){
		scanf("%d", &id);
		Rank[id] = i;
	}
	scanf("%d", &K);
	for(int i = 0; i < K; i++){
		scanf("%d", &id);
		if(Rank[id] == -1){
			printf("%04d: Are you kidding?\n", id);
			continue;
		}
		if(checked[id]){
			printf("%04d: Checked\n", id);
		}else{
			checked[id] = 1;
			if(Rank[id] == 1){
				printf("%04d: Mystery Award\n", id);
			}else if(isPrime(Rank[id])){
				printf("%04d: Minion\n", id);
			}else{
				printf("%04d: Chocolate\n", id);
			}
		}
	}	
	return 0;
}