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

1116. Come on! Let's C (20)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

"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 (<=10000), 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:

61111666688881234555500016888800011111222288882222

Sample Output:

8888: Minion0001: Chocolate1111: Mystery Award2222: Are you kidding?8888: Checked2222: Are you kidding?

思路分析：

设置一个rankl数组来保存每个用户的排名，然后查询时间以此确定用户排名，如果无排名，用0表示。

确定用户排名后即可根据排名及奖励规则确定奖励内容，为了保证每个人只查询以次，设一个judge数组来确定该ID是否已查询过

判断是否是素数采用了打印素数表的方式(Eratosthenes筛法)

题解：

#include <cstdio>#include <algorithm>using namespace std;const int MAX = 10010;int n, k, id;int rankl[MAX] = {0}; bool isprime[MAX], judge[MAX] = {false};void printPrime(){fill(isprime, isprime+MAX, true);isprime[1] = false;for(int i = 2; i <= n; i++){if(isprime[i]){for(int j = i + i; j <= n; j += i) isprime[j] = false;}}}int main(){scanf("%d", &n);for(int i = 1; i <= n; i++){scanf("%d", &id);rankl[id] = i;}printPrime();scanf("%d", &k);while(k--){scanf("%d", &id);if(!rankl[id]) printf("%04d: Are you kidding?\n");else{int r = rankl[id];if(!judge[r]){judge[r] = true;if(r == 1) printf("%04d: Mystery Award\n", id);else if(isprime[r]) printf("%04d: Minion\n", id);else printf("%04d: Chocolate\n", id);}else printf("%04d: Checked\n", id);}}return 0;}