1116 Come on! Let's C

本文介绍了浙江大学计算机科学与技术学院举办的一场趣味编程竞赛“Let's C”,其奖品规则独特:冠军获得神秘大奖,排名为质数的选手赢得小黄人,其余选手获得巧克力。给定排名列表和选手ID,你需要确定每个选手的奖品。题目提供输入输出规格,并附带了一个简单的hash应用参考代码,欢迎大家留言讨论。
摘要由CSDN通过智能技术生成

1116 Come on! Let’s C
“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 (≤10
​4
​​ ), 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:
6
1111
6666
8888
1234
5555
0001
6
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?
hash简单应用
参考代码:

#include<iostream>
#include<cmath>
using namespace std;
struct node{
	int rank;
	bool existed = false, checked = false;
}a[10004];
bool is_prime(int n) {
	if (n == 2)return true;
	int k = sqrt(n);
	for (int i = 2; i <= k; i++)
		if (n%i == 0)return false;
	return true;
}
int main() {
	int n, t, k;
	scanf_s("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &t);
		a[t].rank = i;
		a[t].existed = true;
	}
	scanf_s("%d", &k);
	for (int i = 1; i <= k; i++) {
		scanf_s("%d", &t);
		printf("%04d: ", t);
		if (a[t].existed) {
			if (!a[t].checked) {
				a[t].checked = true;
				if (a[t].rank == 1)cout << "Mystery Award" << endl;
				else if (is_prime(a[t].rank))cout << "Minion" << endl;
				else cout << "Chocolate" << endl;
			}
			else cout << "Checked" << endl;
		}
		else cout << "Are you kidding?" << endl;
	}
	
	return 0;
}

欢迎评论!!!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值