1116. Come on! Let's C (20)
来源:互联网 发布:丹尼斯约翰逊数据 编辑:程序博客网 时间:2024/05/16 12:39
1116. Come on! Let’s C (20)
#include <iostream>#include <iomanip>#include <string>using namespace std;struct rec{ int rank; int ischecked; int islist; string prize;}s[10000];bool isprime(int n){ for(int i=2;i*i<=n;++i) if(n%i==0)return 0; return 1;}int main(){ int n,id; cin>>n; for(int i=1;i<=n;++i){ cin>>id; s[id].rank=i; s[id].islist=1; if(i==1) s[id].prize="Mystery Award"; else if(isprime(i)) s[id].prize="Minion"; else s[id].prize="Chocolate"; } cin>>n; while(n--){ cin>>id; if(!s[id].islist) cout<<setfill('0')<<setw(4)<<id<<": Are you kidding?"<<endl; else if(s[id].ischecked) cout<<setfill('0')<<setw(4)<<id<<": Checked"<<endl; else{ cout<<setfill('0')<<setw(4)<<id<<": "<<s[id].prize<<endl; s[id].ischecked=1; } } return 0;}
0 0
- 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)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C (20)
- 1116. Come on! Let's C
- PAT--1116. Come on! Let's C
- PAT 1116. Come on! Let's C
- 1116. Come on! Let's C
- 【PAT】1116. Come on! Let's C
- 1116. Come on! Let's C 解析
- pat 1116. Come on! Let's C
- solution Of 1116. Come on! Let's C (20)
- 关于 tomcat 集群中 session 共享的三种方法
- 最大子方阵
- LDD之中断
- 数据结构与算法(C语言版)__冒泡排序
- 【解决】java.net.BindException: Address already in use: JVM_Bind
- 1116. Come on! Let's C (20)
- 使用hive来分析flume收集的日志数据
- 1162
- Out of memory on a 14745616-byte allocation.+Bitmap的内存优化
- 深入理解Express.js
- Java语言基础(六)之 —— 循环结构(do...while循环)
- Scroller的用法
- code(vs)1048 石子归并(区间dp)
- 1229