PAT 甲级1116 Come on! Let's C (20分)

趣味编程竞赛奖品分配

最新推荐文章于 2021-09-03 17:22:34 发布

原创最新推荐文章于 2021-09-03 17:22:34 发布 · 193 阅读

0 ·

CC 4.0 BY-SA版权

浙江大学计算机科学与技术学院举办的“Let’sC”编程竞赛，采用独特的奖品分配规则，冠军获神秘大奖，排名为素数者得小黄人，其余人巧克力。本篇解析竞赛规则，分享AC代码实现。

“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?
题目大概意思是把名次做分类还要标记这个名次是否查询过
AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=100001;
int first;//第一名编号
vector<int>prime,Other;//计算已有的质数编号和除去第一名的编号和查询编号列表
bool vis[maxn];
bool is_prime(int s){
if(s==2||s==3) return true;
for(int i=2;i<=sqrt(s);i++){
if(s%i==0) return false;}
return true;}
int main(){
fill(vis,vis+maxn,false);
int n,k,data;
scanf("%d",&n);
scanf("%d",&first);
for(int i=2;i<=n;i++){
scanf("%d",&data);
if(is_prime(i))  prime.push_back(data);
else Other.push_back(data);}
scanf("%d",&k);
for(int i=1;i<=k;i++){
    scanf("%d",&data);
if(vis[data])
printf("%04d: Checked\n",data);
else if(data==first){
        printf("%04d: Mystery Award\n",data);
        vis[data]=true;}
else if(find(prime.begin(),prime.end(),data)!=prime.end()){
    printf("%04d: Minion\n",data);
vis[data]=true;}
else if(find(Other.begin(),Other.end(),data)!=Other.end()){
    printf("%04d: Chocolate\n",data);
vis[data]=true;}
else  printf("%04d: Are you kidding?\n",data);}
system("pause");
return 0;}