【笨方法学PAT】1116 Come on! Let's C （20 分）

最新推荐文章于 2020-08-29 19:17:56 发布

原创最新推荐文章于 2020-08-29 19:17:56 发布 · 159 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

143 篇文章

订阅专栏

一、题目

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

Sample Output:

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

二、题目大意

给出N个学生的排名，输出他们每个人的奖品，排名是质数的奖品小黄人，每个人都有巧克力。若查询人不在排名里，则输出“Are you kidding?”，查询过的输出“Checked”

三、考点

set、数组

四、注意

1、使用数组保存每个人的排名状态，注意没有出现的人；

2、依据排名状态输出查询结果。

五、代码

#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
using namespace std;
int a[10001] = {0};
bool isPrime(int n) {
	if (n == 2 || n == 3)
		return true;
	for (int i = 2; i <= sqrt(n); ++i)
		if (n%i == 0)
			return false;
	return true;
}
int main() {
	//read
	int n;
	cin >> n;

	//build
	for(int i=1;i<=n;++i) {
		int m;
		cin >> m;
		if (i == 1)
			a[m] = 1;
		else if (isPrime(i))
			a[m] = 2;
		else
			a[m] = 3;
	}

	//solve
	set<int> sset;
	cin >> n;
	while (n--) {
		int m;
		cin >> m;
		//cout << m << ": ";
		printf("%04d: ", m);

		//not find
		if (a[m] == 0) {
			cout << "Are you kidding?" << endl;
			continue;
		}

		//Un_Checked
		if (sset.find(m) == sset.end()) {
			sset.insert(m);
			switch (a[m]) {
			case 1:
				cout << "Mystery Award" << endl;
				break;
			case 2:
				cout << "Minion" << endl;
				break;
			case 3:
				cout << "Chocolate" << endl;
				break;
			}	
		}
		//Checked
		else
			cout << "Checked" << endl;
	}

	system("pause");
	return 0;
}