[kuangbin带你飞]专题一 简单搜索-F - Prime Path POJ - 3126

Prime Path

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

题解：

        题目给出两个四位且第一位不为0的正整素数数，要求是让我每次改一位的数字，把第一个素数其改成第二个素数，但是题目还有一个要求，就是再改动过程中出现四位数必须也都是素数。如果存在输出最小操作数，否则输出Impossible.

         很明显的的宽搜题目，每次改一位。就是判断素数会有更好的方法，比如打表，或新看到的米勒罗宾判定法。

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

int S,E;

bool isP(int x){
    int t = 2;
    for (;t*t <= x;t ++){
        if (x%t == 0)return false;
    }
    return true;
}
bool IsPrime[10007];
bool vis[10007];

struct Node {
    int va,step;
    Node(int va = 0,int step = 0):va(va),step(step){}
};

int main()
{
    ios::sync_with_stdio(false);

    for (int i = 1000;i <= 9999;i ++){
        IsPrime[i] = isP(i);
    }

    int T;
    cin >> T;
    while (T --){
        cin >> S >> E;
        memset(vis,0,sizeof(vis));

        queue<Node> qu;
        qu.push(S);
        vis[S] = 1;

        int k,st;
        int flag = 0;
        while (!qu.empty()){
            k = qu.front().va;
            st = qu.front().step;
            qu.pop();

            if (k == E){
                flag = 1;
                break;
            }

            for (int i = 0;i < 10;i ++){
                int t = k/10*10+i;
                if (vis[t] || !IsPrime[t])continue;
                qu.push(Node(t,st+1));
                vis[t] = 1;
            }

            for (int i = 0;i < 10;i ++){
                int t = k/100*100+i*10+k%10;
                if (vis[t] || !IsPrime[t])continue;
                qu.push(Node(t,st+1));
                vis[t] = 1;
            }

            for (int i = 0;i < 10;i ++){
                int t = k/1000*1000+i*100+k%100;
                if (vis[t] || !IsPrime[t])continue;
                qu.push(Node(t,st+1));
                vis[t] = 1;
            }

            for (int i = 0;i < 10;i ++){
                int t = k%1000+i*1000;
                if (vis[t] || !IsPrime[t])continue;
                qu.push(Node(t,st+1));
                vis[t] = 1;
            }
        }
        if (flag)cout << st << endl;
        else cout << "Impossible" << endl;
    }
}