[Poj 3126] Prime Path BFS

Prime Path
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 15588 Accepted: 8791

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<iostream>
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int T;
int n,m;
int p[10001];
int flag;
int ans=0;
int vis[10001];

queue <int> q;  
void bfs()
{
    ans=0;
    flag=0;
    memset(vis,0,sizeof(vis));
    while(!q.empty()) q.pop();
    vis[n]=1;
    q.push(n);
    while(flag==0&&!q.empty())
    {
        int now=q.front();
        q.pop();
        //cout<<now<<endl;
        int N=1;
        for(int i=1;i<=4;i++)
        {
            for(int j=0;j<=9;j++)
            {
                if(i==4&&j==0) continue;
                int nex=now/(N*10)*N*10+N*j+now%N;
                //cout<<nex<<endl;
                if(!p[nex]&&!vis[nex])
                {
                    vis[nex]=vis[now]+1;
                    if(nex==m)
                    {
                        ans=vis[now];
                        flag=1;
                    }
                    q.push(nex);
                }
            }
            N*=10;
        }
    }

}

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

    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        if(n==m)
        {
            printf("0\n");
            continue;
        }
        bfs();
        if(flag)
        printf("%d\n",ans);
        else printf("Impossible\n");
    }

}