1116. Come on! Let's C (20)
来源:互联网 发布:java中wait方法 编辑:程序博客网 时间:2024/05/17 06:45
题目:
“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:
- The Champion will receive a “Mystery Award” (such as a BIG collection of students’ research papers…).
- Those who ranked as a prime number will receive the best award – the Minions (小黄人)!
- 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
2222
Sample Output:
8888: Minion
0001: Chocolate
1111: Mystery Award
2222: Are you kidding?
8888: Checked
2222: Are you kidding?
解答:
//A1116 #include<cstdio>#include<cmath>using namespace std;const int maxn=10010;struct node{ int rank; int flag;}num[maxn];bool isPrime(int a) { int Sqrt = sqrt((double)a); for(int i=2;i<=Sqrt;i++) { if(a%i==0)return false;//"a%i==0"这个判断不能写成“!a%i” } return true;}int main(){ int n,k; bool check[maxn]={false}; scanf("%d",&n); int temp; for(int i=0;i<n;i++){ scanf("%d",&temp); num[temp].rank=i; num[temp].flag=1; } scanf("%d",&k); int x; for(int i=0;i<k;i++){ scanf("%d",&x); printf("%04d: ",x); if(num[x].flag<1)printf("Are you kidding?\n"); else if(num[x].flag==1){ if(num[x].rank==0)printf("Mystery Award\n"); else if(isPrime(num[x].rank+1))printf("Minion\n"); else printf("Chocolate\n"); num[x].flag=2; } else if(num[x].flag==2) printf("Checked\n"); } return 0;}
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C
- PAT--1116. Come on! Let's C
- PAT 1116. Come on! Let's C
- 1116. Come on! Let's C
- 【PAT】1116. Come on! Let's C
- 1116. Come on! Let's C 解析
- pat 1116. Come on! Let's C
- solution Of 1116. Come on! Let's C (20)
- 回顾超链接
- 不仅仅是没有技术
- Java简单剪刀石头布问题
- linux基础(一)
- 信号量有关函数的封装
- 1116. Come on! Let's C (20)
- Python基础(三)
- maven安装和创建项目
- 竖着的Tablayout
- java和C++之单例类双重检查加锁
- apache 配置虚拟目录访问和域名访问的两种方式
- 打Android包的密钥库文件
- Java剪刀石头布随机次数版
- 开发者常用的 Sublime Text 3 插件