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

2023-11-05 01:38

文章标签 20 pat let 1116 come

本文主要是介绍PAT_A 1116. Come on! Let's C (20)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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

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

The Champion will receive a “Mystery Award” (such as a BIG collection of students’ research papers…).
Those who ranked as a prime number will receive the best award – the Minions (小黄人)!
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?

分析
待续
code

#include<iostream>
#include<queue>
#include<map>
#include<exception>
#include<iomanip>
using namespace std;/**采用map的方式更为合理，键为字符串，值为排序*考察排序*还得判断素数* */
bool isPrime(int n)
{if(n<2)return false;for(int i=2;i<n;i++){if(!(double(n)/(double)i-n/i))return false;}return true;
}
int main()
{int m=0;int n=0;int tmp=0;map<int,int> rank;cin>>m;queue<int> que;for(int i=1;i<=m;i++){int tmp;cin>>tmp;rank[tmp]=i;}cin>>n;int max=10000;int max2=0;for(int i=0;i<n;i++){cin>>tmp;que.push(tmp);int tmp2=0;try{tmp2=rank.at(tmp);if(max>tmp2){max=tmp2;max2=tmp;}}catch(exception&e){continue;}}for(int i=0;i<n;i++){int tmp=que.front();que.pop();cout.fill('0');cout<<setw(4)<<tmp<<": ";cout.fill(' ');try{int tmp2=rank.at(tmp);if(tmp2==-3){cout<<"Checked"<<endl;continue;}else if(isPrime(tmp2)==true){cout<<"Minion"<<endl;rank[tmp]=-3;continue;}else if(tmp2==max){cout<<"Mystery Award"<<endl;rank[tmp]=-3;continue;}else {cout<<"Chocolate"<<endl;rank[tmp]=-3;continue;}}catch(exception&e){cout<<"Are you kidding?"<<endl;}}return 0;
}