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?

    C语言比赛,排行获得礼物,根据排行情况进行做出相应决策。

    #include <iostream>
    #include <cmath>
    using namespace std;
    bool isPrime(int a){
        if(a <= 1) return  false;
        for(int i=2;i<=sqrt(a);i++){
            if(a%i==0) return false;
        }
        return true;
    }
    int award[10000000]={0};
    int main(){
        int n;cin>>n;
        int a[n];
        for(int i=0;i<n;i++) cin>>a[i];
        for(int i=0;i<n;i++) award[a[i]]=3;
        award[a[0]]=1;
        for(int i=1;i<n;i++) if(isPrime(i+1)) award[a[i]] = 2;
        int m,tmp;
        cin>>m;
        while(m--){
            cin>>tmp;
            if(award[tmp]==1){
                printf("%04d: Mystery Award
    ",tmp);
                award[tmp]=4;
            }else if(award[tmp]==2){
                printf("%04d: Minion
    ",tmp);
                award[tmp]=4;
            }else if(award[tmp]==3){
                printf("%04d: Chocolate
    ",tmp);
                award[tmp]=4;
            }else if(award[tmp]==4) printf("%04d: Checked
    ",tmp);
            else printf("%04d: Are you kidding?
    ",tmp);
        }
        system("pause");
        return 0;
    }
  • 相关阅读:
    C++ 类的内存分布
    Hadoop集群安装配置教程_Hadoop2.6.0_Ubuntu/CentOS
    Hadoop安装教程_单机/伪分布式配置_Hadoop2.6.0/Ubuntu14.04
    linux 入门教程
    linux shell 常用基本语法
    linux系统的7种运行级别
    Linux学习之CentOS6下Mysql数据库的安装与配置
    二叉树方面的问题
    先贴出代码C++ 中的单例模式
    C++11 中的线程、锁和条件变量
  • 原文地址:https://www.cnblogs.com/littlepage/p/12852537.html
Copyright © 2011-2022 走看看