国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學(xué)院 > 開發(fā)設(shè)計(jì) > 正文

PAT甲級(jí)1116

2019-11-08 20:06:02
字體:
供稿:網(wǎng)友

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

時(shí)間限制200 ms內(nèi)存限制65536 kB代碼長(zhǎng)度限制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;}
發(fā)表評(píng)論 共有條評(píng)論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 勐海县| 祁东县| 广安市| 高邮市| 美姑县| 阳东县| 大邑县| 双鸭山市| 杭锦后旗| 青神县| 泸水县| 竹北市| 晋江市| 山阴县| 崇礼县| 河东区| 香河县| 邻水| 宜黄县| 东城区| 宁南县| 荣成市| 阜新| 新余市| 呼和浩特市| 栾城县| 洱源县| 宜章县| 老河口市| 泗水县| 尉犁县| 福建省| 渭源县| 芜湖市| 周宁县| 霍州市| 永城市| 桦南县| 张掖市| 福建省| 罗定市|