poj-3126 Prime Path（BFS）

Prime Path
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 42542 Accepted: 22450
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

题意：题目很长，但是核心也就标黑的部分，题目要求的是给出两个素数，让一个变到另外一个，每次只变1个数，且变完后必须还是素数。
问：找到在两个给定的四位数素数之间最便宜的素数路径！当然，第一位必须为非零。

#include<iostream>
#include<cmath>
#include<queue>
#include<cstring>
using namespace std;
const int MAXN=10000;
bool vis[MAXN];
struct node{
	int data,s;
};
bool Prime(int x);
int main()
{
	int t,m,n;
	cin>>t;
	while(t--){
		memset(vis,false,sizeof(vis));
		scanf("%d %d",&n,&m);
		if(n==m){
			printf("0\n");
			continue;
		}
		queue<node> Q;
		int f=0;
		node start;
		start.data=n;start.s=0;
		Q.push(start);
		while(!Q.empty()){
			start=Q.front();
			int i;
			//个位
			for(i=1;i<=9;i+=2){
				int tx=start.data/10*10+i;
				if(tx==m){
					f=start.s+1;
					break;
				}
				else if(Prime(tx)&&!vis[tx]){
					vis[tx]=true;
					node stem;
					stem.data=tx;
					stem.s=start.s+1;
					Q.push(stem);
				}
			}
			//十位
			for(i=0;i<=9;i++){
				int tx=start.data/100*100+i*10+start.data%10;
				if(tx==m){
					f=start.s+1;
					break;
				}
				else if(Prime(tx)&&!vis[tx]){
					vis[tx]=true;
					node stem;
					stem.data=tx;
					stem.s=start.s+1;
					Q.push(stem);
				}
			}
			//百位
			for(i=0;i<=9;i++){
				int tx=start.data/1000*1000+i*100+start.data%100;
				if(tx==m){
					f=start.s+1;
					break;
				}
				else if(Prime(tx)&&!vis[tx]){
					vis[tx]=true;
					node stem;
					stem.data=tx;
					stem.s=start.s+1;
					Q.push(stem);
				}
			}
			//千位
			for(i=1;i<=9;i++){
				int tx=start.data%1000+i*1000;
				if(tx==m){
					f=start.s+1;
					break;
				}
				else if(Prime(tx)&&!vis[tx]){
					vis[tx]=true;
					node stem;
					stem.data=tx;
					stem.s=start.s+1;
					Q.push(stem);
				}
			}
			if(f) break;
			Q.pop();
		}
		if(f) printf("%d\n",f);
        else printf("Impossible\n");
	}
	return 0;
}
//判断是否素数
bool Prime(int x){
	bool res=true;           
    if(x<=1) res=false;
    if(x==2||x==3) res=true;
    //sqrt里面的参数明确指明类型为float，防止出现歧义而编译错误
    for(int i=2;i<=int( sqrt(float(x)) );i++)
        if(x%i==0) {
        	res=false;break;
		}
    return res;
}