BFS Prime Path

Prime Path

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 7   Accepted Submission(s) : 5

Problem 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
  
  

 

# include<stdio.h>
# include<string.h>
int q[999999];
int visit[10000]; //该数是否被访问
bool prime[10001];//素数表

void begin()  //筛法打印素数
{
  memset(prime, 1, sizeof(prime));
  prime[0]=false;
  prime[1]=false;
  for(int i=2; i<5000; i++)
  {
    int k =2;
	int next;
	while((next=(k++)*i)<10000)
        prime[next] = false;
  }

}

void bfs(int a, int b)
{
  int front=0, rear=0, i, t, top, step;
  q[rear++]=a;
  visit[a] = 0;
  while(front<rear)
  {
	  top = q[front];
	  if(top%b==0)
	  {
		  step = visit[top];
		  break;
	  }
	  for(i=1; i<=9; i++)
	  {
		t=(top+1000*i)%10000;
	    if(t>=1000&& prime[t]&&visit[t]==-1)
		{	
			q[rear++] = t; 
		    visit[t]=visit[top]+1;
		}
	  }
	  for(i=1; i<=9; i++)
	  {
		  t=(top%1000+100*i)%1000+top/1000*1000;
	    if(prime[t]&&visit[t]==-1)
		{	
			q[rear++] = t; 
		    visit[t]=visit[top]+1;
		}
	  }
	  for(i=1; i<=9; i++)
	  {
		  t=(top%100+10*i)%100+top/100*100;
	    if(prime[t]&&visit[t]==-1)
		{	
			q[rear++] = t; 
		    visit[t]=visit[top]+1;
		}
	  }
      for(i=1; i<=9; i++)
	  {
		  t=(top%10+i)%10+top/10*10;
	    if(prime[t]&&visit[t]==-1)
		{	
			q[rear++] = t; 
		    visit[t]=visit[top]+1;
		}
	  }
      front++;
  }
  if(step==-1)
	  printf("Impossible\n");
  else
	  printf("%d\n", step);
}


int main(void)
{
  int t;
  int a, b;
  begin();
  scanf("%d", &t);
  while(t--)
  {
	memset(visit, -1, sizeof(visit));
    scanf("%d%d", &a, &b);
    bfs(a, b);
  }


  return 0;
}