PATA1116题解

水题。。

//
//  main.cpp
//  PATA1116
//
//  Created by Phoenix on 2018/2/24.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cmath>
const int maxn = 10010;
bool isprime[maxn], q[maxn] = {false};
int vis[maxn] = {0};
int a[maxn];
void prime() {
    isprime[1] = false;
    for(int i = 2; i < maxn; i++) {
        bool flag = true;
        for(int j = 2; j <= sqrt(i); j++) {
            if(i % j == 0) flag = false;
        }
        if(flag) isprime[i] = true;
        else isprime[i] = false;
    }
}

int main(int argc, const char * argv[]) {
    prime();
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        vis[a[i]] = i;
    }
    int k;
    scanf("%d", &k);
    for(int i = 0; i < k; i++) {
        int query;
        scanf("%d", &query);
        if(q[query] == false || vis[query] == 0){
            q[query] = true;
            if(vis[query] == 0) printf("%04d: Are you kidding?\n", query);
            else if(vis[query] == 1) printf("%04d: Mystery Award\n", query);
            else if(isprime[vis[query]] == true) printf("%04d: Minion\n", query);
            else printf("%04d: Chocolate\n", query);
        } else printf("%04d: Checked\n", query);
    }
    return 0;
}