PAT 1116. Come on! Let's C (20) 素数判断题
2018-01-26 00:22
387 查看
/************************* 题意: 第一名 获得 一等奖 第“素数”名 获得 二等奖 其他人获得三等奖 接着给个查询 给出对应几等奖的查询 如果这个人是在排名中的,则只能查一次。 如果不在排名中,输出are you kid me ************************/ /*********************** 解题思路: 这题理解题意即可。 一切都用一个数组Rank[]就行 Rank[i] == 0,说明不在排名中 Rank[i] > 0 ,说明在排名中 Rank[i] = -1,说明已经被检查过了 *************************/ /*********************** *********************/ #include<iostream> #include<stdio.h> #include<string> #include<vector> #include<queue> #include<stdlib.h> #include<algorithm> #include<string.h> #include<stack> #include<map> #include<set> #include<unordered_map> using namespace std; #define M 10005 #define INF 0x7ffffff int Rank[M]; set<int> Set; bool jugeprim(int num){ int i; for(i=2;i*i<=num;i++){ if(num % i == 0) return false; } return true; } int main(){ int n,i; int id; memset(Rank,0,sizeof(Rank)); cin>>n; for(i=1;i<=n;i++){ scanf("%d",&id); Rank[id] = i; } cin>>n; while(n--){ scanf("%d",&id); if(Rank[id] > 0){ if(Rank[id] == 1){ printf("%04d: Mystery Award\n",id); } else if(jugeprim(Rank[id])) printf("%04d: Minion\n", id); else printf("%04d: Chocolate\n", id); Rank[id] = -1; } else if(Rank[id] == 0) printf("%04d: Are you kidding?\n"); else if(Rank[id] == -1) printf("%04d: Checked\n"); } return 0; }
相关文章推荐
- PAT - 甲级 - 1116. Come on! Let's C (20) (桶排思想)
- PAT 甲级 1116. Come on! Let's C (20)
- PAT (Advanced Level) Practise 1116 Come on! Let's C (20)
- PAT_A 1116. Come on! Let's C (20)
- PAT (Advanced Level) Practise 1116 Come on! Let's C (20)
- 【PAT】【Advanced Level】1116. Come on! Let's C (20)
- 1059. C语言竞赛(20) PAT 乙级&&1116. Come on! Let's C (20) PAT甲级
- PAT 甲级 1116. Come on! Let's C (20) 【循环判断】
- 1116. Come on! Let’s C (20)-PAT甲级真题
- PAT 1116. Come on! Let's C
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20) map
- solution Of 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)