Prime Path(HDU-1973)

本文解析了一道经典的算法题目——素数路径问题。题目要求从一个四位素数出发,通过每次更改一位数字的方式到达另一个四位素数,且每一步都必须保持为素数状态。文章提供了详细的解题思路及C++实现代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Prime Path

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 646    Accepted Submission(s): 418


Problem Description
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. 
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
—I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.

Now, the minister of finance, who had been eavesdropping, intervened.
— No unnecessary expenditure, please! I happen to know that the price of a digit is one pound.
— Hmm, in that case I need a computer program to minimize the cost. You don’t know some very cheap software gurus, do you?
—In fact, I do. You see, there is this programming contest going on. . .

Help the prime minister to find the cheapest prime path between any two given four-digit primes! The first digit must be nonzero, of course. Here is a solution in the case above.
1033
1733
3733
3739
3779
8779
8179
The cost of this solution is 6 pounds. Note that the digit 1 which got pasted over in step 2 can not be reused in the last step – a new 1 must be purchased.
 

Input
One line with a positive number: the number of test cases (at most 100). Then for each test case, one line with two numbers separated by a blank. Both numbers are four-digit primes (without leading zeros).
 

Output
One line for each case, either with a number stating the minimal cost or containing the word Impossible.
 

Sample Input
  
3 1033 8179 1373 8017 1033 1033
 

Sample Output
  
6 7 0
 

题目大意:

给两个素数,从第一个素数变化到第二个素数,每次只能改变一个位置上的数,求最小操作步骤。

解题思路:

①使用筛法求素数把10000以内的素数预存。

②千位为0的情况非法,应该忽略。

③枚举时可跳过个位为偶数的情况加快速度(个位为0肯定不是素数)。

④ed数组记录已经出现过的情况避免重复判断。

代码如下:

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
typedef struct Node
{
	int k[4];
	int sum;
}number;
queue<number>q;
void hanshu();
void bfs();
int sushu[10000];
int ed[10000];
int a[4];
int end[4];
int main()
{
	hanshu();
	int n;
	scanf("%d",&n);
	while(n--)
	{
		bfs();
		while(!q.empty())
		q.pop();
	}
	return 0;
}
void bfs()
{
	scanf("%1d%1d%1d%1d",&a[0],&a[1],&a[2],&a[3]);
	scanf("%1d%1d%1d%1d",&end[0],&end[1],&end[2],&end[3]);
	number nb;
	memset(ed,0,sizeof(ed));
	ed[a[0]*1000+a[1]*100+a[2]*10+a[3]] = 1;
	nb.k[0] = a[0];
	nb.k[1] = a[1];
	nb.k[2] = a[2];
	nb.k[3] = a[3];
	nb.sum = 0;
	q.push(nb);
	while(!q.empty())
	{
		nb = q.front();
		q.pop();
		if(nb.k[0] == end[0] && nb.k[1] == end[1] && nb.k[2] == end[2] && nb.k[3] == end[3])
		{
			printf("%d\n",nb.sum);
			return ;
		}
		for(int i=0 ; i<4 ; i++)
		{
			number new_n=nb ;
			new_n.sum++;
			for(int j=0 ; j<10 ; j++)
			{
				new_n.k[i] = j;
				if(i+j==0) continue;
				if(i==4 && j%2) continue;
				if(!ed[new_n.k[0]*1000+new_n.k[1]*100+new_n.k[2]*10+new_n.k[3]] && !sushu[new_n.k[0]*1000+new_n.k[1]*100+new_n.k[2]*10+new_n.k[3]])
				{
					ed[new_n.k[0]*1000+new_n.k[1]*100+new_n.k[2]*10+new_n.k[3]] = 1;
					q.push(new_n);
				}
			}
		}
	}
}
void hanshu()
{
	sushu[0] = 1;
	sushu[1] = 1;
	for(int i=2 ; i<10000 ; i++)
	for(int j=i*i ; j<10000 ; j+=i)
	sushu[j] = 1;
}


题目传送门。。。。。


内容概要:该研究通过在黑龙江省某示范村进行24小时实地测试,比较了燃煤炉具与自动/手动进料生物质炉具的污染物排放特征。结果显示,生物质炉具相比燃煤炉具显著降低了PM2.5、CO和SO2的排放(自动进料分别降低41.2%、54.3%、40.0%;手动进料降低35.3%、22.1%、20.0%),但NOx排放未降低甚至有所增加。研究还发现,经济性和便利性是影响生物质炉具推广的重要因素。该研究不仅提供了实际排放数据支持,还通过Python代码详细复现了排放特征比较、减排效果计算和结果可视化,进一步探讨了燃料性质、动态排放特征、碳平衡计算以及政策建议。 适合人群:从事环境科学研究的学者、政府环保部门工作人员、能源政策制定者、关注农村能源转型的社会人士。 使用场景及目标:①评估生物质炉具在农村地区的推广潜力;②为政策制定者提供科学依据,优化补贴政策;③帮助研究人员深入了解生物质炉具的排放特征和技术改进方向;④为企业研发更高效的生物质炉具提供参考。 其他说明:该研究通过大量数据分析和模拟,揭示了生物质炉具在实际应用中的优点和挑战,特别是NOx排放增加的问题。研究还提出了多项具体的技术改进方向和政策建议,如优化进料方式、提高热效率、建设本地颗粒厂等,为生物质炉具的广泛推广提供了可行路径。此外,研究还开发了一个智能政策建议生成系统,可以根据不同地区的特征定制化生成政策建议,为农村能源转型提供了有力支持。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值