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

感觉自己整的好菜，什么都不会

#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;

typedef long long ll;
int num[5];
int vis[10000];
int prime[10010];

void init(){
	for(int i=2;i<=9999;i++)
		prime[i]=1;
	for(int i=2;i<=9999;i++){
		if(prime[i]){
			for(int j=i+i;j<=9999;j+=i)
			   prime[j]=0;
		}
	}
}

struct node{
	int val;
	ll step;
}now,next;

ll bfs(int st,int ed){
	vis[st]=1;
	queue<node> q;
	now.step=0;
	now.val=st;
	q.push(now);
	while(q.size()){
		now=q.front();
		q.pop();
		if(now.val==ed)
			return now.step;
		int i=4,val=now.val;
		while(val){
			num[i--]=val%10;
			val/=10; 
		}
		for(int i=1;i<=4;i++){
			for(int j=0;j<=9;j++){
				switch(i){
					case 1:
						if(j==0) continue;
						val=j*1000+num[2]*100+num[3]*10+num[4];break;
					case 2:
						val=num[1]*1000+j*100+num[3]*10+num[4];break;
					case 3:
						val=num[1]*1000+num[2]*100+j*10+num[4];break;
					case 4:
						if(j%2==0) continue;
						val=num[1]*1000+num[2]*100+num[3]*10+j;
				}
				if(vis[val]||!prime[val]) continue;
				vis[val]=1;
				next.step=now.step+1,next.val=val;
				q.push(next);
			}
		}
	}
	return -1;
} 

int main(){	
    init();
	int T;
	scanf("%d",&T);
	while(T--){
		memset(vis,0,sizeof(vis));
		int a,b;
		scanf("%d %d",&a,&b);
		ll ans=bfs(a,b);
		if(ans==-1)
		  printf("Impossible\n");
		else
		  printf("%lld\n",ans);
	}
}