PAT 1116 Come on! Let‘s C-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_50679551/article/details/127408069

这篇博客介绍了一种编程竞赛的排名规则，并展示了如何处理查询以确定获奖者。给定排名列表和查询ID，程序会返回对应奖项。通过使用哈希映射和布尔数组，可以有效地检查ID是否存在和是否已被查询过。博主分享了实现代码，强调了学习和不断进步的重要性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1116 Come on! Let's C

"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 (≤104), 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:

Sample Output:

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

总结：这道题目之前在乙级做过，但是当时感觉还是挺难的，想不出来怎么判断一个id是否有重复查询，现在直接使用一个bool类型的数组就解决了，前路漫漫亦灿灿！

代码：

#include <iostream>
#include <map>
using namespace std;

const int N=10010;
map<int,int> m;
bool st[N];
int n,k;

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

int main(){
    scanf("%d",&n);
    int id;
    for(int i=0;i<n;i++){
        scanf("%d",&id);
        m[id]=i+1;
        st[id]=true;
    }
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        scanf("%d",&id);
        printf("%04d: ",id);
        if(m[id] && st[id]){
            st[id]=false;
            if(m[id]==1)    printf("Mystery Award\n");
            else if(isprime(m[id])) printf("Minion\n");
            else printf("Chocolate\n");
        }
        else if(m[id]==0)   printf("Are you kidding?\n");
        else printf("Checked\n");
    }
    return 0;
}

好好学习，天天向上！

我要考研！