zoukankan      html  css  js  c++  java
  • 1116 Come on! Let's C (20 分)

    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 (≤), 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?

    map一下就ok

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 map<string, int> mp, mp1;
     4 int n,m, prim[20000];
     5 void init(){
     6     prim[0] = prim[1] = 1;
     7     for(int i = 2; i < 20000; i++){
     8         if(prim[i] == 0){
     9             for(int j = 2; j*i < 20000; j++)
    10                 prim[i*j] = 1;
    11         }
    12     }
    13 }
    14 int main(){
    15     cin >> n;
    16     string s;
    17     init();
    18     for(int i = 1; i <= n; i++){
    19         cin >> s;
    20         mp[s] = i;
    21     }
    22     cin >> m;
    23     for(int i = 0; i < m; i++){
    24         cin >> s;
    25         cout <<s<<": ";
    26         if(mp[s] == 1 && mp1[s] == 0){
    27             mp1[s] = 1;
    28             cout <<"Mystery Award"<<endl;
    29         }else if(mp[s] == 0){
    30             cout <<"Are you kidding?"<<endl;
    31         }else if(prim[mp[s]] == 0 && mp1[s] == 0){
    32             mp1[s] = 1;
    33             cout <<"Minion"<<endl;
    34         }else if(mp1[s] == 0){
    35             mp1[s] = 1;
    36             cout <<"Chocolate"<<endl;
    37         }else{
    38             cout <<"Checked"<<endl;
    39         }
    40     }
    41     return 0;
    42 }




  • 相关阅读:
    BZOJ 3754 Tree之最小方差树
    【CSS】318- CSS实现宽高等比自适应容器
    【Vuejs】317- 提升90%加载速度——Vuecli下的首屏性能优化
    【H5】316- 移动端H5跳坑指南
    【每周小回顾】2- 一起回顾上周精彩内容
    【Webpack】315- 手把手教你搭建基于 webpack4 的 vue2 多页应用
    【Web技术】314- 前端组件设计原则
    【JS】313- 复习 回流和重绘
    【JS】312- 复习 JavaScript 严格模式(Strict Mode)
    【Canvas】311- 解决 canvas 在高清屏中绘制模糊的问题
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/11330209.html
Copyright © 2011-2022 走看看