PAT_A1116#Come on! Let's C

2019-06-11 21:03:33 阅读：357 来源： 互联网

标签：8888 int Award Let PAT isPrime include Come ID

Source:

PAT A1116 Come on! Let's C (20 分)

Description:

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

Keys:

素数（Prime）

Attention:

对于较大规模的数据，采用打表的方法可以大大的优化时间，平时应该养成习惯已备不时之需；

Code:

 1 /*
 2 Data: 2019-06-11 20:19:43
 3 Problem: PAT_A1116#Come on! Let's C
 4 AC: 15:40
 5 
 6 题目大意：
 7 按排名给出N名同学的ID，
 8 第一名，Mystery Award
 9 素数名次，Minion
10 其他名次，Chocolate
11 询问过了，Checked
12 占便宜者，Are you kidding?
13 */
14 
15 #include<cstdio>
16 #include<string>
17 #include<vector>
18 #include<iostream>
19 using namespace std;
20 const int M=1e5;
21 int isPrime[M],n,name;
22 string id[M];
23 vector<int> prime;
24 
25 void Euler()
26 {
27     fill(isPrime,isPrime+n+1,1);
28     isPrime[0]=0;isPrime[1]=0;
29     for(int i=2; i<=n; i++){
30         if(isPrime[i])
31             prime.push_back(i);
32         for(int j=0; j<prime.size(); j++){
33                 if(i*prime[j]>n)
34                     break;
35                 isPrime[i*prime[j]]=0;
36                 if(i%prime[j]==0)
37                     break;
38         }
39     }
40 }
41 
42 int main()
43 {
44 #ifdef    ONLINE_JUDGE
45 #else
46     freopen("Test.txt", "r", stdin);
47 #endif
48 
49     scanf("%d", &n);
50     Euler();
51     for(int i=1; i<=n; i++)
52     {
53         scanf("%d", &name);
54         if(i == 1)
55             id[name] = "Mystery Award";
56         else if(isPrime[i])
57             id[name] = "Minion";
58         else
59             id[name] = "Chocolate";
60     }
61     scanf("%d", &n);
62     for(int i=0; i<n; i++)
63     {
64         scanf("%d", &name);
65         printf("%04d: ", name);
66         if(id[name].size() != 0){
67             cout << id[name] << endl;
68             id[name] = "Checked";
69         }
70         else
71             cout << "Are you kidding?" << endl;
72     }
73 
74     return 0;
75 }

标签：8888,int,Award,Let,PAT,isPrime,include,Come,ID
来源： https://www.cnblogs.com/blue-lin/p/11005952.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9