优先队列+BFS（2）

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>
#include<math.h>
#include <queue>
using namespace std;
#define N 10100
int a1[N];
int book1[N];
struct node
{
    int x,step;
};
void subiao()
{
    int i,j;
    memset(book1,0,sizeof(book1));
   for(i=2;i<N;i++)
   {
       if(book1[i]==0)
       {
           for(int j=i*i;j<N;j+=i)
           {
               book1[j]=1;
           }
       }

   }
}
int BFS(int xx,int yy)
{
    int book[N],num;
    memset(book,0,sizeof(book));
    queue<node>Q;
    node p,q;
    p.x=xx;
    p.step=0;
    book[xx]=1;
    Q.push(p);
    while(!Q.empty())
    {
        p=Q.front();
       Q.pop();
       if(p.x==yy)
       {
           return p.step;
       }
       int t[5];
        t[1]=p.x/1000;   ///记录千位数
        t[2]=p.x/100%10;  ///记录百位数
        t[3]=p.x/10%10;   ///记录十位
        t[4]=p.x%10;   ///记录ge位
         for(int i=1;i<=4;i++)
        {
            int gg=t[i]; ///gai  bian
            for(int j=0;j<10;j++)
            {
                if(t[i]!=j)
                {
                    t[i]=j;
                    num=t[1]*1000+t[2]*100+t[3]*10+t[4];
                }
                if(num>=1000 && num<=9999 && book[num]==0 && book1[num]==0)   ///判断该4位数是否满足条件，
                {
                    q.x=num;
                    q.step=p.step+1;  ///若满足，步数加1，压入队列，标记...
                    Q.push(q);
                    book[num]=1;
                }
            }
            t[i]=gg;  ///恢复
        }

    }
    return -1;
}
int main()
{
    int n,a,b,ans;
    subiao();
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d",&a,&b);
        ans=BFS(a,b);
        if(ans!=-1)
            printf("%d\n",ans);
        else
            printf("Impossible\n");
    }
    return 0;
}