PAT_1116

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

题目描述

“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:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
6
1111
6666
8888
1234
5555
0001
6
8888
0001
1111
2222
8888
2222

Sample Output:

1
2
3
4
5
6
8888: Minion
0001: Chocolate
1111: Mystery Award
2222: Are you kidding?
8888: Checked
2222: Are you kidding?

思路

直接根据题目中的要求进行模拟即可

首先根据排名给出选手的id,第一名会获得 Mystery Award,排名为素数的会获得Minion,其余则获得Chocolate,如果查询的id没有再排名中给出,则输出Are you kidding?,如果后面重复查询某个选手所获得的奖励则输出Checked

程序

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#define INF 0x3f3f3f3f

using namespace std;

const int maxn = 1e5+5;
const int maxm = 1e4+5;
typedef long long ll;
int n,k,ranks[maxn];
bool used[maxn];

bool Judge(int x)
{
for(int i = 2;i*i <= x ;i ++)
if(x % i == 0)
return false;
return true;
}
int main()
{
int x;
scanf("%d",&n);
for(int i =1 ;i <= n;i ++)
scanf("%d",&x),ranks[x] = i;
scanf("%d",&k);

for(int i = 0;i < k;i ++)
{
scanf("%d",&x);
if(ranks[x] == 0)
printf("%04d: Are you kidding?\n",x);
else if(used[x])
printf("%04d: Checked\n",x);
else
{
if(ranks[x] == 1)
printf("%04d: Mystery Award\n",x);
else if(Judge(ranks[x]))
printf("%04d: Minion\n",x);
else
printf("%04d: Chocolate\n",x);

used[x] = 1;
}
}

}

写在后面

本题可以使用简单的方法进行素数判定,如果需要判断某区间内所有素数,那么可以使用Euler筛法

-------------本文结束感谢您的阅读-------------
显示 Gitment 评论