pat 1116 Come on! Let's C(20 分)
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:
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?
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 }
相关文章
- Json.Net - Error getting value from 'ScopeId' on 'System.Net.IPAddress'
- 【vnc】vncserver: couldn't find "xauth" on your PATH 问题
- RMAN backup validate database on databases in noarchivelog mode
- yii2定时任务不执行,报错PHP date调用警告:It is not safe to rely on the system's timezone settings
- $().click()和$().on('click',function(){})的区别
- Warning: Using a password on the command line interface can be insecure.
- 大叔经验分享(16)Context namespace element 'component-scan' and its parser class [org.springframework.context.annotation.ComponentScanBeanDefinitionParser] are only available on JDK 1.5 and higher
- Vuejs——(5)v-on
- CrazySNS has on line - And you'll see why 1984 won't be like "1984."
- Atitit s2018.6 s6 doc list on com pc.docx Atitit s2018.6 s6 doc list on com pc.docx Aitit algo fix 算法系列补充.docx Atiitt 兼容性提示的艺术 attilax总结.docx Atitit 应用程序容器化总结 v2 s66.docx Atitit file cms api
- 【习题 8-10 UVA - 1614】Hell on the Markets
- 【MATLAB】基本绘图 ( 绘图基本步骤 | plot 函数 | 多曲线绘制 | hold on / off )
- 谣言检测(ClaHi-GAT)《Rumor Detection on Twitter with Claim-Guided Hierarchical Graph Attention Networks》
- jQuery on()方法
- PAT 1116 Come on! Let's C [简单]
- Caused by: java.lang.ClassNotFoundException: Didn't find class "io.grpc.helloworldexample.HelloworldActivity" on path: DexPathList
- MySQL远程连接报错2003-cant connection to mysql server on ‘IP’(10061 unknown error)