POJ 3126-Prime Path 简单搜索 BFS

最新推荐文章于 2020-10-10 22:15:42 发布

原创最新推荐文章于 2020-10-10 22:15:42 发布 · 966 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

PKU ACM

简单搜索

本文介绍了一种使用广度优先搜索(BFS)解决素数路径问题的方法。通过建立素数表，对输入的四数字素数进行操作，每次只改变一个数字，并确保结果仍为素数，直至达到目标数字。文章提供了完整的C++代码实现。

题目来源：http://acm.pku.edu.cn/JudgeOnline/problem?id=3126

解题报告：

还是BFS，广度优先搜索

对一个数abcd，那么与它邻接的数就是改变其中一个位的数字得到的

当改变其中一位后，若该数为素数，且之前未被访问过，则放入队列中进行下一步的搜索

这样，搜索下去，直到搜索到我们最终需要变成的那个数，退出

输出结果，应该是得到的从s到goal的最短路径。

#include <iostream> #include <queue> using namespace std; int isPrime[10000]; int color[10000]; int d[10000]; void findPrime() //建立一个素数表 { for(int i=2;i<10000;i++) isPrime[i]=1; for(int i=2;i<5000;i++) { for(int j=2;j<=i;j++) { int temp=i*j; if(temp>=10000) break; else isPrime[temp]=0; } } } int BFS(int s,int goal) { for(int i=0;i<10000;i++) { color[i]=0; d[i]=0; } if(s==goal) return 0; color[s]=1; d[s]=0; queue<int> Q; Q.push(s); while(!Q.empty()) { int u=Q.front(); Q.pop(); int n[4]; n[0]=u/1000; //千位数 n[1]=(u-n[0]*1000)/100; //百位数 n[2]=(u-n[0]*1000-n[1]*100)/10;//十位数 n[3]=u-1000*n[0]-n[1]*100-n[2]*10;//个位数 int k=1; for(int j=3;j>=0;j--) { if(j!=3) k=10*k; for(int i=-n[j];i<10-n[j];i++) { int temp=u+i*k; if(isPrime[temp] && color[temp]==0 && temp>=1000) { color[temp]=1; d[temp]=d[u]+1; if(temp==goal) return d[temp]; Q.push(temp); } } } color[u]=2; } return 0; } int main() { findPrime(); int caseNum; cin >> caseNum; while(caseNum--) { int s,goal; cin >> s >> goal; cout << BFS(s,goal) << endl; } }

附录：

Prime Path

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4497		Accepted: 2631

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