poj3126 Prime Path

Prime Path

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 24887		Accepted: 13718

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

题意:给你两个四位素数a和b；每次可以改变位数的一个数字 要求得到的新的四位数必须是素数；

问从a到b最少要改变几次；不能得到输出Impossible；

思路：bfs的话 每次改变一个位置 从个位到千位每次改变一个位置 注意对素数进行剪枝

思路还是很清晰的

ac代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

struct Q
{
    int prime;
    int step;
};

int a,b;

bool Isprime(int dig)
{
    if(dig == 2 || dig == 3)
        return true;
    else if(dig <= 1 || dig%2 == 0)
        return false;
    else if(dig > 3)
    {
        for(int i = 3; i*i <= dig; i+=2)
            if(dig%i == 0)
            return false;
        return true;
    }

}

bool vist[15000];
Q que[15000];

void bfs()
{

    int i;
    int head,tail;
    head = tail = 0;
    que[head].prime = a;
    que[head].step = 0;
    tail++;
    vist[a] = true;

    while(head < tail)
    {
        Q x = que[head++];

        if(x.prime == b)
        {
            printf("%d\n",x.step);
            return ;
        }

        int unit = x.prime%10;
        int dec = (x.prime/10)%10;

        for( i = 1; i <= 9; i+=2)//个位
        {
            int y = (x.prime/10)*10+i;
            if(y != x.prime && !vist[y] && Isprime(y))
            {
                vist[y] = true;
                que[tail].prime = y;
                que[tail++].step = x.step+1;
            }
        }

        for( i = 0; i <= 9; i++)//十位
        {
            int y = (x.prime/100)*100+unit+i*10;
            if(y != x.prime && !vist[y] && Isprime((y)))
                {
                    vist[y] = true;
                    que[tail].prime = y;
                    que[tail++].step = x.step+1;
                }
        }

        for( i = 0; i <= 9; i++)
        {
            int y = (x.prime/1000)*1000+i*100+dec*10+unit;
            if(y != x.prime && !vist[y] && Isprime(y))
            {
                vist[y] = true;
                que[tail].prime = y;
                que[tail++].step = x.step+1;
            }
        }

        for( i = 1; i <= 9; i++)
        {
            int y = (x.prime%1000)+i*1000;
            if(y != x.prime && !vist[y] && Isprime(y))
            {
                vist[y] = true;
                que[tail].prime = y;
                que[tail++].step = x.step+1;
            }
        }


    }
printf("Impossible\n");
    return ;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(vist,false,sizeof(vist));
        scanf("%d %d",&a,&b);
        bfs();
    }
    return 0;
}