Prime Path_bfs_2018_2_21

Prime Path

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 24649		Accepted: 13594

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

Source

Northwestern Europe 2006

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;

const int N=1e5+10;
bool prime[N];

void init(){
	memset(prime,1,sizeof(prime));
	prime[0]=prime[1]=0;
	for(int i=2;i<N;i++)
	for(int j=i+i;j<N;j+=i)
	if(prime[j])prime[j]=false;
}

int a[4];
int vis[N];

int n,m;

void bfs(){
	queue<int> q;
	q.push(n);
	vis[n]=0;
	while(!q.empty()){
		int x=q.front();
		for(int i=0;i<4;i++){
			a[i]=x%10;
			x/=10; 
		}
		x=q.front();
		q.pop();
		for(int i=0;i<4;i++){
			int t=a[i];
			for(int j=0;j<10;j++){
				if(j==0&&i==3)
				continue;
				a[i]=j;
				int num=0,b=1;
				for(int k=0;k<4;k++){
					num+=a[k]*b;
					b*=10;
				}
				if(prime[num]&&vis[num]==-1){
					vis[num]=vis[x]+1;
					q.push(num);
				}
				if(num==m)return;
			}
			a[i]=t;
		}
	}
}

int main(){
	init();
	int z;
	scanf("%d",&z);
	while(z--){
		memset(a,0,sizeof(a));
		memset(vis,-1,sizeof(vis));
		scanf("%d%d",&n,&m);
		bfs();
		if(vis[m]!=-1)
		printf("%d\n",vis[m]);
		else printf("Impossible\n");
	}
}