zoukankan      html  css  js  c++  java
  • PAT 1116 Come on! Let's C

    "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 (≤10^4​​ ), 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<vector>
    #include<math.h>
    using namespace std;
    bool isprime(int p){
    	if(p==1||p<=0) return false;
    	for(int i=2; i<=sqrt(p); i++)
    		if(p%i==0)
    			return false;
    	return true;
    }
    int main(){
      int n, id, m;
      cin>>n;
      vector<int> ranklist(10000,-1);
      for(int i=0; i<n; i++){
        cin>>id;
        ranklist[id]=i+1;
      }
      cin>>m;
      for(int i=0; i<m; i++){
        cin>>id;
        if(ranklist[id]==1){
          printf("%04d: Mystery Award
    ", id);
          ranklist[id]=-2;
        }else if(isprime(ranklist[id])){
          printf("%04d: Minion
    ", id);
          ranklist[id]=-2;
    	}else if(ranklist[id]==-2)
          printf("%04d: Checked
    ", id);
        else if(ranklist[id]==-1)
    	  printf("%04d: Are you kidding?
    ", id);
    	else{
          printf("%04d: Chocolate
    ", id);
          ranklist[id]=-2;
        }
      }
      return 0;
    }
    
  • 相关阅读:
    HDOJ/HDU 2352 Verdis Quo(罗马数字与10进制数的转换)
    HDOJ/HDU 2203 亲和串(简单的判断~Java的indexOf()方法秒)
    HDOJ/HDU 2163 Palindromes(判断回文串~)
    js之函数
    js琐碎知识点
    position
    css属性background
    图片展示失效容错处理
    文字打点
    浮动的一些知识点
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/9502039.html
Copyright © 2011-2022 走看看