首页 > 学院 > 开发设计 > 正文

PAT甲级1116

2019-11-08 20:06:02
字体:
来源:转载
供稿:网友

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

时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, Yue

"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:
61111666688881234555500016888800011111222288882222Sample Output:
8888: Minion0001: Chocolate1111: Mystery Award2222: Are you kidding?8888: Checked2222: Are you kidding?
#include<cstdio>#include<algorithm>#include<vector>using namespace std;const int maxn = 10000+10;int N, K;vector<int> v;bool flag[maxn] = { false };bool isPrime(int x){	if (x < 2)return false;	int sq = sqrt(x);	for (int i = 2; i <= sq; i++)	{		if (x%i == 0)return false;	}	return true;}bool find(int x,int &index){	for (int i = 0; i < N; i++)	{		if (v[i] == x)		{			index = i;			return true;		}	}	return false;}int main(){	scanf("%d", &N);	int t;	for (int i = 0; i < N; i++)	{		scanf("%d", &t);		v.push_back(t);	}	scanf("%d", &K);	int index = -1;	for (int i = 0; i < K; i++)	{		scanf("%d", &t);		if (find(t,index))		{			if (!flag[index])			{				flag[index] = true;				if (index == 0)				{					printf("%04d: Mystery Award/n", t);				}				else if (index != 0)				{					if (isPrime(index + 1))					{						printf("%04d: Minion/n", t);					}					else						printf("%04d: Chocolate/n", t);				}			}			else				printf("%04d: Checked/n",t);					}		else			printf("%04d: Are you kidding?/n",t);	}	return 0;}
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表