E - 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<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
using namespace std;
int n,a,b;
int prime[10004]= {0};
int tag[10004]= {0};
void init()//素数筛法，将所有素数都标记出来
{
    prime[1]=1;
    for(int i=2; i<=sqrt(10000); i++)
    {
        if(prime[i]==0)
        {
            for(int j=i+i; j<=10000; j+=i)
            {
                prime[j]=1;
            }
        }
    }
}
struct node
{
    int x;
    int step;
};
void bfs()
{
    node now,next;
    queue<node>q;
    now.x=a;
    now.step=0;
    q.push(now);
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        next.step=now.step+1;
        if(now.x==b)
        {
            printf("%d\n",now.step);
            return ;
        }
        for(int j=0; j<4; j++)
        {
            for(int i=0; i<=9; i++)
            {
                if(j==0)//个位
                {
                    next.x=now.x-now.x%10+i;
                }
                else if(j==1)//十位
                {
                    next.x=now.x+(i-now.x%100/10)*10;
                }
                else if(j==2)//百位
                {
                    next.x=now.x+(i-now.x%1000/100)*100;
                }
                else if(j==3&&i!=0)//千位，千位不能为0
                {
                    next.x=now.x+(i-now.x/1000)*1000;
                }
                if(prime[next.x]==0&&tag[next.x]==0)
                {
                    q.push(next);
                    tag[next.x]=1;
                }
            }
        }
    }
    printf("Impossible\n");
    return;
}
int main()
{
    init();
    scanf("%d",&n);
    while(n--)
    {
        memset(tag,0,sizeof(tag));
        scanf("%d%d",&a,&b);
        if(a==b)
        {
            printf("0\n");
            continue;
        }
        tag[a]=1;
        bfs();
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<queue>
#include<math.h>
#define min 0x3f3f3f3f
 
using namespace std;
 
int arr[10005];
int flag[10005];
int n,m;
 
void prim()//素数打表
{
    int i,j;
    arr[0]=arr[1]=1;
    for(i=2;i<=10000;i++)
    {
        if(!arr[i])
        {
            for(j=i*2;j<=10000;j+=i)
            arr[j]=1;
        }
    }
}
 
int bfs(int first,int last)
{
    queue <int>q;
    int v,i,j,temp,vtemp,count[10005],N[4];
    memset(flag,0,sizeof(flag));
    memset(count,0,sizeof(count));
    q.push(first);
    flag[first]=1;
    while(!q.empty())
    {
        v=q.front();
        q.pop();
        N[0]=v/1000;
        N[1]=v%1000/100;
        N[2]=v%100/10;
        N[3]=v%10;
        for(j=0;j<4;j++)
        {
            temp=N[j];
            for(i=0;i<10;i++)//枚举每种情况
                if(i!=temp)
                {
                    N[j]=i;
                    vtemp=N[0]*1000+N[1]*100+N[2]*10+N[3];
                    if(!flag[vtemp] && !arr[vtemp] &&vtemp>1000)
                    {
                        flag[vtemp]=1;//标记
                        count[vtemp]=count[v]+1;//步数加一
                        q.push(vtemp);
                    }
                    if(vtemp==last) return count[vtemp];//当变化完之后的值相等，返回其步数
                }
            N[j]=temp;//将原本的赋值回去
        }
        if(v==last) return count[v];//若两个数相等，返回其步数
    }
    return -1;
}
 
int main()
{
    int t,k;
    cin>>t;
    prim();
    while(t--)
    {
        cin>>n>>m;
        k=bfs(n,m);
        if(k!=-1)
        cout<<k<<endl;
        else
        cout<<"Impossible"<<endl;
    }
    return 0;
}
 

#include <map>
#include <list>
#include <climits>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define eps 1e-9
#define LL unsigned long long
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define CRR fclose(stdin)
#define CWW fclose(stdout)
#define RR freopen("input.txt","r",stdin)
#define WW freopen("output.txt","w",stdout)

const int Max = 10010;
struct node
{
    int x;
    int num;
};

int n,m;
bool prime[Max];
bool vis[Max];
int bfs()
{
    memset(vis,false,sizeof(vis));
    node a,b;
    a.num=0;
    a.x=n;
    queue<node>Q;
    vis[n]=true;
    Q.push(a);
    while(!Q.empty())
    {
        a=Q.front();
        Q.pop();
        if(a.x==m)
        {
            return a.num;
        }
        for(int i=0;i<10;i++)
        {
            b.x=a.x/10*10+i;
            b.num=a.num+1;
            if(!vis[b.x]&&!prime[b.x])
            {
                vis[b.x]=true;
                Q.push(b);
            }
        }
        for(int i=0;i<10;i++)
        {
            int s=a.x%10;
            b.x=a.x/100*100+i*10+s;
            b.num=a.num+1;
            if(!vis[b.x]&&!prime[b.x])
            {
                vis[b.x]=true;
                Q.push(b);
            }
        }
        for(int i=0;i<10;i++)
        {
            int s=a.x%100;
            b.x=a.x/1000*1000+i*100+s;
            b.num=a.num+1;
            if(!vis[b.x]&&!prime[b.x])
            {
                vis[b.x]=true;
                Q.push(b);
            }
        }
        for(int i=1;i<10;i++)
        {
            b.x=a.x%1000+i*1000;
            b.num=a.num+1;
            if(!vis[b.x]&&!prime[b.x])
            {
                vis[b.x]=true;
                Q.push(b);
            }
        }
    }
    return 0;
}
int main()
{
    memset(prime,false,sizeof(prime));
    prime[1]=true;
    prime[0]=true;
    m=sqrt(Max)+1;
    for(int i=2;i<m;i++)
    {
        if(!prime[i])
        {
            for(int j=i*i;j<=Max;j+=i)
            {
                prime[j]=true;
            }
        }
    }
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&m);
        printf("%d\n",bfs());
    }
    return 0;
}