PAT--1116. Come on! Let's C

来源：互联网发布：小学生英语软件人教版编辑：程序博客网时间：2024/05/16 13:07

1116. Come on! Let’s C

题解

简单模拟一下。

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 10000;int Rank[maxn];bool check[maxn];int n, tmp, q;bool isPrime(int n){    if(n < 2) return false;    for(int i = 2; i * i <= n; ++i){        if(n % i == 0) return false;    }    return true;}int main(){#ifdef EXMYfreopen("data.in", "r", stdin);#endif // EXMY    while(cin >> n){        memset(Rank, 0, sizeof(Rank));        memset(check, 0, sizeof(check));        for(int i = 1; i <= n; ++i){            scanf("%d", &tmp);            Rank[tmp] = i;        }        cin >> q;        while(q--){            cin >> tmp;            if(Rank[tmp] == 1) {                if(check[tmp]) printf("%04d: %s\n", tmp, "Checked");                else{                    check[tmp] = true;                    printf("%04d: %s\n", tmp, "Mystery Award");                }            }else if(isPrime(Rank[tmp])){                if(check[tmp]) printf("%04d: %s\n", tmp, "Checked");                else{                    check[tmp] = true;                    printf("%04d: %s\n", tmp, "Minion");                }            }else if(Rank[tmp]){                if(check[tmp]) printf("%04d: %s\n", tmp, "Checked");                else{                    check[tmp] = true;                    printf("%04d: %s\n", tmp, "Chocolate");                }            }else{                printf("%04d: %s\n", tmp, "Are you kidding?");            }        }    }    return 0;}

0 0