PAT甲级1116 Come on! Let's C (20 分)

最新推荐文章于 2020-08-27 20:08:01 发布

rf4csdm

最新推荐文章于 2020-08-27 20:08:01 发布

阅读量115

点赞数

分类专栏： PAT甲级文章标签： PAT

本文链接：https://blog.csdn.net/qq_42306885/article/details/100026465

版权

PAT甲级专栏收录该内容

158 篇文章 0 订阅

订阅专栏

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:

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:

1111

6666

8888

1234

5555

0001

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?

题目大意：

给出n个排名信息，以及n个查询。如果是冠军则输出Mystery Award，如果排名是素数则输出Minion，如果是其他的则输出Chocolate。同时如果并没有这号人，则输出Are you kidding? ，如果询问过了，则输出Checked

思路：

由于要根据排名进行相应的输出所有struct node 中肯定要有r，保存排名，同时存储一个flag 用于识别是否查询过，接着就是写好isprime算法即可。

参考代码：

#include<cstdio>
struct node{
	int r;
	bool flag;
}list[100000];
int n;
bool isprime(int v){
	if(v <= 1) return false;
	for(int i = 2; i * i <= v; ++i )
		if(v % i == 0)	return false;
	return true;
}
int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; ++i){
		int id;
		scanf("%d", &id);
		list[id].r = i + 1;
	}
	scanf("%d", &n);
	for(int i = 0; i < n; ++i){
		int id;
		scanf("%d", &id);
		printf("%04d: ", id);
		if(list[id].flag && list[id].r != 0) printf("Checked\n");
		else{
			if(list[id].r  == 0)	printf("Are you kidding?\n");
			else if(list[id].r == 1) printf("Mystery Award\n");
			else if(isprime(list[id].r)) printf("Minion\n");
			else printf("Chocolate\n");
		}
		list[id].flag = true;
	}
	return 0;
}