PAT 甲级 1116. Come on! Let's C (20)
2017-10-18 08:03
483 查看
“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?
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?
#include <iostream> #include <cstdio> using namespace std; bool isPrime(int n) { if(n<=1) return false; for(int i=2;i*i<=n;i++){ if(n%i==0) return false; } return true; } int main() { int n; cin>>n; int a ; for(int i=0;i<n;i++){ cin>>a[i]; } int t; cin>>t; int book[10001]={0}; while(t--){ int id; cin>>id; printf("%04d: ",id); for(int j=0;j<n;j++){ if(a[j]==id) { if(book[id]==1) cout<<"Checked"<<endl; if(book[id]==0&&id==a[0]){ cout<<"Mystery Award"<<endl; book[id]=1; } if(book[id]==0&&isPrime(j+1)){ cout<<"Minion"<<endl; book[id]=1; } if(book[id]==0){ cout<<"Chocolate"<<endl; book[id]=1; } } } if(book[id]==0) cout<<"Are you kidding?"<<endl; } return 0; }
相关文章推荐
- PAT 甲级 1116. Come on! Let's C (20) 【循环判断】
- 1116. Come on! Let’s C (20)-PAT甲级真题
- PAT - 甲级 - 1116. Come on! Let's C (20) (桶排思想)
- PAT 1116. Come on! Let's C (20) 素数判断题
- 1059. C语言竞赛(20) PAT 乙级&&1116. Come on! Let's C (20) PAT甲级
- PAT (Advanced Level) Practise 1116 Come on! Let's C (20)
- 【PAT】【Advanced Level】1116. Come on! Let's C (20)
- PAT (Advanced Level) Practise 1116 Come on! Let's C (20)
- PAT_A 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)
- pat甲1116. Come on! Let's C(模拟)
- 1116. Come on! Let's C (20)解题报告
- 1116. Come on! Let's C (20) map
- PAT--1116. Come on! Let's C