Prime Path POJ - 3126

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

题意

给你素数n，m 每次变化n的某一位 使它变为另一个素数 问最少多好次可以变成m

思路

最少变化，重复某一过程，用bfs （bfs好强大，好神奇，好厉害，以前一直以为bfs只是图的题，知道现在做了kuangbin大佬的搜素专题）

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
int pri[10010];
struct node
{
    int num;
    int step;
}ans[15000];
int vis[10100];
int n,m;
void bfs()
{
    int a,b,c,d;
    int i;
    int head = 0,tail = 0;
    ans[tail].num = n;
    ans[tail++].step = 0;
    vis[n] = 1;
    while(head<tail)
    {
        //cout<<ans[head].num<<endl;
        node x = ans[head++];
        if(x.num==m)
        {
            cout<<x.step<<endl;
            return ;
        }
        //cout<<x.num<<endl;
        d = x.num%10;
        c = (x.num/10)%10;
        b = (x.num/100)%10;
        a = x.num/1000;
        //cout<<a<<" "<<b<<" "<<c<<" "<<d<<endl;
        for(i=0;i<10;i++)
        {
            int y = a*1000 + b*100 + c*10 + i;//枚举个位
            if(!vis[y]&&!pri[y])
            {
                ans[tail].num = y;
                ans[tail++].step = x.step+1;
                vis[y] = 1;
            }
        }
        for(i=0;i<10;i++)
        {
            int y = a*1000 + b*100 + i*10 + d;//枚举十位
            if(!vis[y]&&!pri[y])
            {
                ans[tail].num = y;
                ans[tail++].step = x.step+1;
                vis[y] = 1;
            }
        }
        for(i=0;i<10;i++)
        {
            int y = a*1000 + i*100 + c*10 + d; //枚举百位
            if(!vis[y]&&!pri[y])
            {
                ans[tail].num = y;
                ans[tail++].step = x.step+1;
                vis[y] = 1;
            }
        }
        for(i=1;i<10;i++)
        {
            int y = i*1000 + b*100 + c*10 + d;//枚举千位，应注意千位不可为0
            if(!vis[y]&&!pri[y])
            {
                ans[tail].num = y;
                ans[tail++].step = x.step+1;
                vis[y] = 1;
            }
        }
    }
    cout<<"Impossible"<<endl;
}
int main()
{
    int i,j,t;
    memset(pri,0,sizeof(pri));
    pri[0]=1,pri[1]=1;
    for(i=2;i<=10000;i++)
    {
        if(pri[i]==0)
        {
            for(j=i*2;j<=10000;j+=i)
            {
                pri[j] = 1;
            }
        }
    }
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        memset(vis,0,sizeof(vis));
        bfs();
    }
    return 0;
}