Prime Path（广度优先搜索bfs）

Prime Path

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

解答

简单bfs，代码如下：

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int vis[10000],M,N;
queue<int> q;
bool judge(int n){
	for(int i=2;i*i<=n;i++)
	if(n%i==0)
	return false;
	return true;
}
void bfs(){
	q.push(M);
	int cnt=0;
	while(!q.empty()){
		int now=q.front();
		if(now==N){
			printf("%d\n",vis[N]);
			return;
		}
		q.pop();
		int fir=now/1000;
		for(int i=1;i<=9;i++){
		if(i!=fir){
			int nx=i*1000+now%1000;
			if(judge(nx)&&!vis[nx]){
				vis[nx]=vis[now]+1;
				q.push(nx);	
			}
		}	
		}
		int sec=now%1000/100;
		for(int i=0;i<=9;i++){
			if(i!=sec){
				int nx=fir*1000+i*100+now%100;
				if(judge(nx)&&!vis[nx]){
					vis[nx]=vis[now]+1;
					q.push(nx);
				}
			}
		}
		int thd=now%100/10;
		for(int i=0;i<=9;i++){
			if(i!=thd){
				int nx=fir*1000+sec*100+i*10+now%10;
				if(judge(nx)&&!vis[nx]){
					vis[nx]=vis[now]+1;
					q.push(nx);
				}
			}
		}
		int fou=now%10;
		for(int i=1;i<=9;i++){
			if(i%2&&i!=fou){
				int nx=fir*1000+sec*100+thd*10+i;
				if(judge(nx)&&!vis[nx]){
				    vis[nx]=vis[now]+1;
					q.push(nx);
				}
			}
		}
	}
	
}
int main(){
	int n;
	scanf("%d",&n);
	while(n--){
	memset(vis,0,sizeof(vis));
	while(!q.empty()) q.pop();
	scanf("%d%d",&M,&N);
	bfs();	
	}
	return 0; 
} 

继续努力哈哈哈