1116 Come on! Let's C -PAT甲级

浙江大学计算机科学技术学院举办的Let'sC编程竞赛采用趣味奖项分配规则,冠军获得神秘大奖,排名为素数者赢得小黄人,其余参赛者则获得巧克力。本篇详细介绍了竞赛奖品的分配逻辑及其实现代码。

"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<bits/stdc++.h>
using namespace std;
const int N=10005;
int pm[N],vst[N];
void is_prime(){
	fill(pm,pm+N,1);
	pm[0]=0;
	pm[1]=0;
	for(int i=2;i*i<=N;i++){
		if(pm[i]){
			for(int j=i+i;j<=N;j+=i){
				pm[j]=0;
			}
		}
	}
}
struct stu{
	int rank=0;
}st[N];
int n,k;
int main(){
	fill(vst,vst+N,0);
	is_prime();
	cin>>n;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		st[x].rank=i;
	}
	cin>>k;
	for(int i=1;i<=k;i++){
		int x;
		cin>>x;
		if(vst[x]){
			printf("%04d: Checked\n",x);
		}else if(st[x].rank==0){
			printf("%04d: Are you kidding?\n",x);
		}else if(st[x].rank==1){
			vst[x]=1;
			printf("%04d: Mystery Award\n",x);
		}else if(pm[st[x].rank]){
			vst[x]=1;
			printf("%04d: Minion\n",x);
		}else{
			vst[x]=1;
			printf("%04d: Chocolate\n",x);
		}
	} 
	return 0;
}

 

内容概要:本文介绍了一个针对电力系统连锁故障传播路径的N-k多阶段双层优化及故障场景筛选模型,该模型基于混合整数线性规划(MILP)方法构建,旨在全面评估电力系统在遭受多重故障时的脆弱性与恢复能力。通过引入故障传播路径的概念,模型能够动态模拟故障在电网中的逐级扩散过程,并结合多阶段优化策略,实现对关键故障场景的有效识别与优先排序。整个框架不仅考虑了初始故障元件的选取,还涵盖了后续因潮流转移引发的级联跳闸行为,从而提升了风险评估的准确性与时效性。该研究已在Matlab平台上完成代码实现,具备良好的可复现性和工程应用价值,适用于提升现代电网的安全防御水平。; 适合人群:电力系统、能源安全及相关领域的科研人员、高校研究生以及从事电网规划与运行管理的工程技术人员。; 使用场景及目标:①用于电力系统安全评估中识别最危险的N-k故障组合;②支撑电网应急预案制定与薄弱环节改造;③作为学术研究中关于级联故障建模与优化求解的教学与验证工具;④服务于智能电网背景下抵御蓄意攻击或极端事件的风险防控决策。; 阅读建议:建议读者结合Matlab代码深入理解模型的数学 formulation 与求解流程,重点关注目标函数设计、约束条件构建及双层优化结构的实现逻辑,同时可通过调整系统参数和故障设定进行仿真对比分析,以掌握不同因素对连锁故障演化的影响规律。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值