【算法笔记】B1059 C语言竞赛

用map存排名，再定义一个数组存是否领过奖品。测试点2出错原因找了好久，发现是最后一种情况忘了把check[id]置1

还是得细心啊

code：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10010;
map<int, int> id_list;
int check[maxn] = {0};
bool isPrime(int n){
    if(n <= 3) return n > 1;
    for (int i = 2; i <= sqrt(n); i++){
        if(n % i == 0) return false;
    }
    return true;
}
int main(){
    int n, id, k;
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d", &id);
        id_list[id] = i + 1;
    }
    cin>>k;
    for(int i = 0; i < k; i++){
        scanf("%d", &id);
        map<int, int>::iterator it = id_list.find(id);
        if(it == id_list.end()) printf("%04d: Are you kidding?
", id);
        else if(check[id] == 1) printf("%04d: Checked
", id);
        else if(it->second == 1){
            printf("%04d: Mystery Award
", id);
            check[id] = 1;
        }else if(isPrime(it->second)){
            printf("%04d: Minion
", id);
            check[id] = 1;
        }else{
            printf("%04d: Chocolate
", id);
            check[id] = 1;
        }
    }
    return 0;
}