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.

解析

排名第一輸出 Mystery Award,排名爲質數輸出 Minion,其他輸出 chocolate。如果查詢的人之前被查過輸出 Checked。

代碼

#include<bits/stdc++.h>
#include<string>

#define INF 1<<29

using namespace std;

int n;
map<string, string> data;
const int maxn = 10005;
int primes[maxn] = {0};

bool isPrime(int num) {
    if (num == 1) return false;
    int sqr = sqrt(num);
    for (int i = 2; i <= sqr; ++i) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

void getPrimes() {
    int index = 0;
    for (int i = 1; i < maxn; ++i) {
        if (isPrime(i))
            primes[i] = 1;
    }
}

void pat1116() {
    getPrimes();
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        string str;
        cin >> str;
        if (i == 1)
            data[str] = "Mystery Award";
        else if (primes[i])
            data[str] = "Minion";
        else
            data[str] = "Chocolate";
    }
    int t;
    cin >> t;
    map<string, int> temp;
    for (int i = 0; i < t; ++i) {
        string str;
        cin>>str;
        if (data.find(str) == data.end()) {
            temp[str] = 1;
            cout << str << ": Are you kidding?" << endl;
        } else if (temp[str]) {
            cout << str << ": Checked" << endl;
        } else {
            cout << str << ": " << data[str] << endl;
            temp[str] = 1;
        }
    }
}

int main() {
    pat1116();
    return 0;
}
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章