1116 Come on! Let‘s C(38行代码+详细注释)

分数 20

全屏浏览题目

作者 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 (≤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?

代码长度限制

16 KB

时间限制

200 ms

内存限制

64 MB

#include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int exist[10004];
bool isprime(int a){
    if(a<=1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){//输入 
        int id;
        cin>>id;
        mp[id]=i;
    }
    int k;
    cin>>k;
    while(k--){//查询 
        int id;
        cin>>id;
        if(exist[id]==1){//若id被查询过 
            if(mp[id])printf("%04d: Checked\n",id);//若该id存在 
            else printf("%04d: Are you kidding?\n",id);//若该id不存在 
        }
        else{//若id没被查询过 
            exist[id]=1;//置为访问过 
            if(mp[id]==1)printf("%04d: Mystery Award\n",id);//id排第一 
            else if(isprime(mp[id]))printf("%04d: Minion\n",id);//不排第一但是为第素数位 
            else if(mp[id])printf("%04d: Chocolate\n",id);//都不是但是id存在 
             else printf("%04d: Are you kidding?\n",id);//id不存在 
        }
    }
    return 0;
}