zoukankan      html  css  js  c++  java
  • 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?
    #include<cstdio>
    const int maxn = 10010;
    int IDtoAward[maxn] = {0};
    
    char award[5][20] = {"Are you kidding?","Mystery Award","Minion","Chocolate","Checked"};
    
    bool isPrime(int x){
        if(x <= 1) return false;
        for(int i = 2; i * i <= x; i++){
            if(x % i == 0) return false;
        }
        return true;
    }
    
    int main(){
        int n,id;
        scanf("%d",&n);
        for(int i = 1; i <= n; i++){
            scanf("%d",&id);
            if(i == 1){
                IDtoAward[id] = 1;
            }else if(isPrime(i)){
                IDtoAward[id] = 2;
            }else{
                IDtoAward[id] = 3;
            }
        }
        scanf("%d",&n);
        while(n--){
            scanf("%d",&id);
            printf("%04d: %s
    ",id,award[IDtoAward[id]]);
            if(IDtoAward[id]){
                IDtoAward[id] = 4;
            }
        }
        return 0;    
    }
  • 相关阅读:
    HangFire快速入门
    HangFire概述
    Lodop错误汇总
    微信支付过程遇到的问题
    动态规划算法
    几句话~
    Welcom To My Blog
    【技巧】关于素数
    安徽省小学组省赛2014年第一题 木板面积(C++)
    洛谷 P1425 小鱼的游泳时间
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10453465.html
Copyright © 2011-2022 走看看