A1116 Come on! Let's C （20 分）

#include<cstdio>
#include<cmath>
using namespace std;
const int maxn = 10010;
bool isprime(int n)
{
	if (n <= 1) return false;
	else
	{
		int sqr = (int)sqrt(1.0*n);
		for (int i = 2; i <= sqr; i++)
		{
			if (n%i == 0) return false;
		}
		return true;
	}
}
bool exist[maxn] = { 0 }, vis[maxn] = { 0 };
int rank[maxn];
int main()
{
	int n,query,temp;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &temp);
		exist[temp] = 1;
		rank[temp] = i;
	}
	scanf("%d", &query);
	for (int i = 0; i < query; i++)
	{
		scanf("%d", &temp);
		if (exist[temp] == 0) printf("%04d: Are you kidding?\n", temp);
		else
		{
			if (vis[temp] == 1) printf("%04d: Checked\n", temp);
			else
			{
				vis[temp] = 1;
				if (rank[temp] == 1) printf("%04d: Mystery Award\n", temp);
				else if (isprime(rank[temp]) == true) printf("%04d: Minion\n", temp);
				else printf("%04d: Chocolate\n", temp);
			}
		}
	}
	return 0;
}