1116. Come on! Let's C (20)
2018-03-01 14:36
459 查看
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:
6 1111 6666 8888 1234 5555 0001 6 8888 0001 1111 2222 8888 2222Sample Output:
8888: Minion 0001: Chocolate 1111: Mystery Award 2222: Are you kidding? 8888: Checked 2222: Are you kidding?
#include<stdio.h> #include<math.h> struct node{ int rank; int check; node(){ check=0; } }stu[10010]; int isprime(int x){ double sqr=sqrt(x); for(int i=2;i<=sqr;i++){ if(x%i==0){ return 0; } } return 1; } int main(){ int n,i,k,id; scanf("%d",&n); for(i=1;i<=n;i++){ scanf("%d",&id); stu[id].rank=i; stu[id].check=1; } scanf("%d",&k); int query; for(i=0;i<k;i++){ scanf("%d",&query); if(stu[query].check==0){ printf("%04d: Are you kidding?\n",query); } else if(stu[query].check==1){ stu[query].check=2; if(stu[query].rank==1){ printf("%04d: Mystery Award\n",query); } else if(isprime(stu[query].rank)){ printf("%04d: Minion\n",query); } else{ printf("%04d: Chocolate\n",query); } } else{ printf("%04d: Checked\n",query); } } }
相关文章推荐
- 1116. Come on! Let's C (20) <map>
- 1116. Come on! Let's C (20)[map]
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)解题报告
- PAT 1116. Come on! Let's C (20) 素数判断题
- PAT_A 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20) map
- solution Of 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- PAT - 甲级 - 1116. Come on! Let's C (20) (桶排思想)
- 1116. Come on! Let's C (20)
- PAT 甲级 1116. Come on! Let's C (20) 【循环判断】
- 1116. Come on! Let's C (20) 简单模拟
- 1116. Come on! Let’s C (20)-PAT甲级真题
- 【PAT】【Advanced Level】1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- PAT (Advanced Level) Practise 1116 Come on! Let's C (20)
- 甲题题解-1116. Come on! Let’s C (20)-(素数筛选法)