PAT (Advanced Level) Practise 1116 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:

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?

简单题，开两个数组，一个记录编号对应的排名，一个记录是否出现过即可。

#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define ff first
#define ss second
#define mp(i,j) make_pair(i,j)
#define pb push_back
#define pii pair<int,LL>
#define in(x) scanf("%d", &x);
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-4;
const int INF = 0x7FFFFFFF;
const int mod = 998244353;
const int N = 1e5 + 10;
int n, m, x;
int f[N], g[N];

bool check(int x)
{
  for (int i = 2; i*i <= x; i++) if (x%i == 0) return false;
  return true;
}

int main()
{
  scanf("%d", &n);
  rep(i, 1, n) scanf("%d", &x), f[x] = i;
  scanf("%d", &m);
  rep(i, 1, m)
  {
    scanf("%d", &x);
    if (!f[x]) { printf("%04d: Are you kidding?\n", x); continue; }
    if (g[x]) { printf("%04d: Checked\n", x); continue; }
    g[x] = 1;
    if (f[x] == 1) { printf("%04d: Mystery Award\n", x); continue; }
    if (check(f[x])) printf("%04d: Minion\n", x);
    else printf("%04d: Chocolate\n", x);
  } 
  return 0;
}