Prime Path POJ - 3126

问一个四位的素数，每次只更改一个数字，保证更改后的四位数仍然是素数，问最短几次可以得到目标数字

先计算出素数表，再BFS，每次更改四位数中的一位数，判断合不合法，直到得到目标数字，注意这里也是要book标记数组的～不然会死循环的哦～反正都是一个套路，只有一点点不一样的地方

//leehaoze
#include <iostream>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstdlib>

using namespace std;
const int INF = 1<<29;
#define INC_SAT( val ) (val = ((val)+1 > (val)) ? (val)+1 : (val))
#define ARR_SIZE( a ) ( sizeof( (a) ) / sizeof( (a[0]) ) )
#define ULL unsigned long long
#define MAXN (10000 + 5)

struct Number{
    Number(int v,int s,Number *n):value_(v),step_(s),pre_(n){}
    int value_;
    int step_;
    Number* pre_;
};

int T;
int Start,End;
int num[] = {0,1,2,3,4,5,6,7,8,9};
bool prime[MAXN];
bool book[MAXN];
void Is_Prime(){
    memset(prime,true,sizeof prime);
    prime[0] = false;
    for (int i = 2; i < MAXN; ++i) {
        if(prime[i] && i % 2 == 0){
            prime[i] = false;
            continue;
        }
        if(prime[i]){
            for (int j = 3; j < MAXN / i; j+=2) {
                prime[j * i] = false;
            }
        }
    }
}

bool Legal(int num){
    return num < 10000 && prime[num] && !book[num];
}

void BFS(){
    memset(book,false,sizeof book);
    queue<Number*> Q;
    Number *s = new Number(Start,0,NULL);
    Q.push(s);
    while(!Q.empty()){
        Number *now = Q.front();
        Q.pop();
        if(now->value_ == End){
            cout << now->step_ << endl;
//            Number *n = now;
//            while(n != NULL){
//                cout << n->value_ << endl;
//                n = n->pre_;
//            }
            return ;
        }
        for (int i = 0; i < 4; ++i) {
            for (int j = 0; j < 10; ++j) {
                int temp;
                if(i == 0){ // 首位
                    if(j == 0)continue;
                    temp = now->value_ % 1000;
                    temp += num[j] * 1000;
                }
                else if(i == 1){
                    temp = now->value_ / 1000 * 1000;
                    temp += num[j] * 100;
                    temp += now->value_ % 100;
                }
                else if(i == 2){
                    temp = now->value_ / 100  * 100;
                    temp += num[j] * 10;
                    temp += now->value_ % 10;
                }
                else if(i == 3){
                    temp = now->value_ / 10 * 10;
                    temp += num[j];
                }
                if(temp == now->value_)continue;
                if(Legal(temp)){
                    book[temp] = true;
//                    cout << temp << endl;
                    Number *n = new Number(temp,now->step_ + 1,now);
                    Q.push(n);
                }
            }
        }
    }
    cout << "Impossible" << endl;
}

int main() {
#ifdef LOCAL
    freopen("IN.txt", "r", stdin);
#endif
    std::ios::sync_with_stdio(false);
    Is_Prime();
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&Start,&End);
        BFS();
    }
}