【PAT甲级A1116】 Come on! Let‘s C (20分)（c++）

1116 Come on! Let’s C (20分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：200 ms
内存限制：64 MB

“Let’s C” is a popular and fun programming contest hosted by the College of Computer Science and Technology, Zhejiang University. Since the idea of the contest is for fun, the award rules are funny as the following:

• 0、 The Champion will receive a “Mystery Award” (such as a BIG collection of students’ research papers…).
• 1、 Those who ranked as a prime number will receive the best award – the Minions (小黄人)!
• 2、 Everyone else will receive chocolates.

Given the final ranklist and a sequence of contestant ID’s, you are supposed to tell the corresponding awards.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤10​^4​​ ), the total number of contestants. Then N lines of the ranklist follow, each in order gives a contestant’s ID (a 4-digit number). After the ranklist, there is a positive integer K followed by K query ID’s.

Output Specification:
For each query, print in a line ID: award where the award is Mystery Award, or Minion, or Chocolate. If the ID is not in the ranklist, print Are you kidding? instead. If the ID has been checked before, print ID: Checked.

Sample Input:

6
1111
6666
8888
1234
5555
0001
6
8888
0001
1111
2222
8888
2222

Sample Output:

8888: Minion
0001: Chocolate
1111: Mystery Award
2222: Are you kidding?
8888: Checked
2222: Are you kidding?

题意：

第一名获得Mystery Award，第素数名（2,3,5…）获得Minion，其他获得Chocolate，给出排序，然后给出一组人id，判断他获得什么奖励，每人只能获得一次奖励，不再排名内的人不获得奖励。

思路：

用vector保存排名的id，然后用find函数来找他的排名（即所在位置），超出容器长度则表示没找到。（注意排名是1-N的下标）。

参考代码：

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;
bool flag[10010] = {false};

bool isprime(int v) {
    for (int i = 2; i <= sqrt(1.0 * v); i++)
        if (v % i == 0)return false;
    return true;
}

int main() {
    int n, k, id;
    scanf("%d", &n);
    vector<int> v(n + 1);
    for (int i = 0; i < n; i++) {
        scanf("%d", &v[i]);
    }
    scanf("%d", &k);
    for (int i = 0; i < k; i++) {
        scanf("%d", &id);
        printf("%04d: ", id);
        int index = find(v.begin(), v.end(), id) - v.begin() + 1;
        if (flag[index] && index <= n) {
            printf("Checked\n");
            continue;
        }
        if (index == 1)printf("Mystery Award\n");
        else if (isprime(index))printf("Minion\n");
        else if (index <= n)printf("Chocolate\n");
        else printf("Are you kidding?\n");
        flag[index] = true;
    }
    return 0;
}

如有错误，欢迎指正