pat 1116 Come on! Let's C（20 分）

最新推荐文章于 2026-01-09 14:09:33 发布

转载最新推荐文章于 2026-01-09 14:09:33 发布 · 88 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/GetcharZp/p/9582003.html

文章标签：

#开发工具

本文介绍了一种基于排名和素数判断的编程竞赛奖品分配算法，详细解析了输入输出规格，通过示例展示了算法运行流程。文章还提供了一份完整的C++代码实现，包括读取参赛者排名、判断素数、分配奖品并处理重复查询的功能。

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 (

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?

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <map>
 6 #include <stack>
 7 #include <vector>
 8 #include <queue>
 9 #include <set>
10 using namespace std;
11 const int MAX = 30;
12 
13 int n;
14 // 0 Mystery Award 1 Minion  2 Chocolate
15 char s[MAX], ss[4][MAX] = {{"Mystery Award"}, {"Minion"}, {"Chocolate"}};
16 map <string, int> mp;
17 set <string> st;
18 
19 bool is_prime(int x)
20 {
21     for (int i = 2; i * i <= x; ++ i)
22         if (x % i == 0) return false;
23     return true;
24 }
25 
26 int main()
27 {
28 //    freopen("Date1.txt", "r", stdin);
29     scanf("%d%s", &n, &s);
30     mp[s] = 0;
31     for (int i = 2; i <= n; ++ i)
32     {
33         scanf("%s", &s);
34         if (is_prime(i)) mp[s] = 1;
35         else mp[s] = 2;
36     }
37 
38     scanf("%d", &n);
39     while (n --)
40     {
41         scanf("%s", &s);
42         if (st.find(s) != st.end()) printf("%s: Checked\n", s);
43         else if (mp.find(s) == mp.end()) printf("%s: Are you kidding?\n", s);
44         else
45         {
46             printf("%s: %s\n", s, ss[mp[s]]);
47             st.insert(s);
48         }
49     }
50     return 0;
51 }

转载于:https://www.cnblogs.com/GetcharZp/p/9582003.html