1116. Come on! Let's C (20)_contestant id's,-优快云博客

本文介绍了一场由浙江大学计算机科学技术学院举办的趣味编程竞赛“Let's C”，并详细说明了其独特的奖品分配规则：冠军获得神秘大奖，排名为素数的选手获得小黄人玩偶，其余选手则获得巧克力。此外，提供了完整的代码实现，用于根据最终排名和参赛者ID确定相应的奖品。

"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:

Sample Output:

8888: Minion
0001: Chocolate
1111: Mystery Award
2222: Are you kidding?
8888: Checked
2222: Are you kidding?

代码实现

#include <iostream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;

bool isPrime(int n)
{
    if(n<=1) return false;
    int sqr = sqrt(1.0*n);
    for(int i=2;i<=sqr;i++)
    {
        if(n%i==0) return false;
    }
    return true;
}
int ran[10000];
int main()
{
    int n,k;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int id;
        cin>>id;
        ran[id]=i+1;
    }
    cin>>k;
    set<int> ss;
    for(int i=0;i<k;i++)
    {
        int id;
        cin>>id;
        printf("%04d: ",id);
        if(ran[id]==0)
        {
            printf("Are you kidding?\n");
            continue;
        }
        if(ss.find(id)==ss.end())
        {
            ss.insert(id);
        }
        else{
            printf("Checked\n");
            continue;
        }
        if(ran[id]==1)
        {
            printf("Mystery Award\n");
        }
        else if(isPrime(ran[id]))
        {
            printf("Minion\n");
        }
        else
        {
            printf("Chocolate\n");
        }
    }
    return 0;
}