1116. Come on! Let's C
来源:互联网 发布:联通网络测速手机版 编辑:程序博客网 时间:2024/04/30 00:26
1116. Come on! Let's C (20)
"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<iostream>#include<set>#include<vector>#include<cmath>using namespace std;int id[10001];bool f[10001];bool isprime(int num){for(int i=2;i<=sqrt((double)num);i++)if(num%i==0)return false;return true;}int main(){int n;cin>>n;for(int i=1;i<=n;i++){cin>>id[i];f[i]=false;}int k;cin>>k;for(int i=0;i<k;i++){int ckid;cin>>ckid;int num=0;for(int j=1;j<=n;j++){if(ckid==id[j]){num=j;if(f[num]==false){f[num]=true;if(num==1)printf("%04d: Mystery Award\n",ckid);else if(isprime(num))printf("%04d: Minion\n",ckid);elseprintf("%04d: Chocolate\n",ckid);}elseprintf("%04d: Checked\n",ckid);break;}}if(!num)printf("%04d: Are you kidding?\n",ckid);}return 0;}
- 1116. Come on! Let's C
- 1116. Come on! Let's C (20)
- PAT--1116. Come on! Let's C
- 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)
- 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 (20)
- 1116. Come on! Let's C 解析
- pat 1116. Come on! Let's C
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- Come on! Let's C
- CentOS6.5搭建LNMP
- Java第三章习题3-6(完数)
- 【LightOJ 1248】Dice (III)(概率DP)
- UI层自动化测试框架(六):持续集成和测试报告
- cocos2d-x--->飞机大战的总结0913
- 1116. Come on! Let's C
- android轻量级开源缓存框架——ASimpleCache(ACache)源码分析
- swith & if 应用场景 及区别
- 隐藏,覆盖,重载的区别
- Andrew Ng -machine learning 课堂笔记(一)第六周
- Android 设计模式 之 单例模式
- PC硬件与系统维护--第一版
- 循序表操作样例
- C++main函数的参数