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

太过爱你忘了你带给我的痛 2022-05-28 13:17 102阅读 0赞

"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<stdio.h>
    #include<map>
    #include<iostream>
    #include<string>
    #include<math.h>
    using namespace std;
    map<string,int> Map1,Map2;
    int isPrime(int n)
    {
        int i,j;
        for(i=2;i<=sqrt(n);i++)
        {
            if(n%i==0)
            {
                break;
            }
        }
        if(i<=sqrt(n))
        {
            return 0;
        }
        else
        {
            return 1;
        }
    }
    int main()
    {
        int i,j,n,m,k,t;
        string s;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
           cin>>s;
           Map1[s]=i;
        }
        scanf("%d",&m);
        for(i=0;i<m;i++)
        {
            cin>>s;
            if(Map1.find(s)==Map1.end())
            {
                printf("%s: Are you kidding?\n",s.c_str());
            }
            else
            {
                if(Map2.find(s)!=Map2.end())
                {
                    printf("%s: Checked\n",s.c_str());
                }
                else
                {
                    if(Map1[s]==1)
                    {
                        printf("%s: Mystery Award\n",s.c_str());
                    }
                    else if(isPrime(Map1[s])==1)
                    {
                        printf("%s: Minion\n",s.c_str());
                    }
                    else
                    {
                        printf("%s: Chocolate\n",s.c_str());
                    }
                }
            }
            Map2[s]=1;
        }
        return 0;
    }