PAT甲级 1116 Come on! Let's C （20 分）hash散列

最新推荐文章于 2019-11-12 10:47:30 发布

love music.

最新推荐文章于 2019-11-12 10:47:30 发布

阅读量168

点赞数

本文链接：https://blog.csdn.net/qq_29762941/article/details/84886993

版权

PAT 同时被 3 个专栏收录

122 篇文章 6 订阅

订阅专栏

PAT

113 篇文章 9 订阅

订阅专栏

Hash

3 篇文章 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:

Sample Output:

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

题目大意：按排名输入id,接着查询。查询时第一名输出 Mystery Award ，排名是素数的输出 Minion,其它排名输出 Chocolate。注意已查询过的输出Are you kidding? 。

解题思路: 用hash散列来存储与查询即可，输入过程中直接判断对应奖项。用flag来标记是否已查询过。

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

struct node{
	int rank;
	int award;
};

bool isprime(int num){
	for(int i=2;i<=sqrt(num);i++){
		if(num%i == 0)
			return false;
	}
	return true;
}

int main(){
	int n,m;
	cin>>n;
	node arr[10001];
	int flag[10001] = {0}; 
	int id,rank;
	for(int i=1;i<=n;i++){
		cin>>id;
		flag[id] = 1;
		arr[id].rank = i;
		if(i == 1)
			arr[id].award = 1;
		else{
			if(isprime(i))
				arr[id].award = 2;
			else
				arr[id].award = 3;
			}
	}
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>id;
		if(flag[id] == 0)
		    printf("%04d: Are you kidding?\n",id);
		else if(flag[id] == 1){
			if(arr[id].award == 1)
				printf("%04d: Mystery Award\n",id);
			else if(arr[id].award == 2)
				printf("%04d: Minion\n",id);
			else
				printf("%04d: Chocolate\n",id);
			flag[id] = 2;
		}else
			printf("%04d: Checked\n",id);	
	}
	
	return 0;
}