搜索专题 I

1、简单描述

从一个素数变化成另一个素数，每次变换只能更改一个数字，并且变换过程中所有出现的数均为素数，至少要经过多少种变换

2、思路

# include <iostream>
# include <queue>
# include <cmath>
# include <cstring>
using namespace std;
int n, m;
const int N = 1e4 + 100;
int vis[N];

struct node
{
    int x, step;
};

queue<node> Q;
bool judge_prime(int x)
{
    if(x < 2)
        return false;
    int sqr = (int)sqrt(x*1.0);
    for(int i = 2; i <= sqr; i++)
        if(x % i == 0)
            return false;
    return true;
}

void BFS()
{
    int X, STEP, i;
    while(!Q.empty())
    {
        node tmp;
        tmp = Q.front();
        Q.pop();
        X = tmp.x;
        STEP = tmp.step;
        if(X == m)
        {
            cout << STEP << endl;
            return ;
        }
        for(i = 1; i <= 9; i += 2) //个位
        {
            int s = X / 10 * 10 + i;
            if(s != X && !vis[s] && judge_prime(s))
            {
                vis[s] = 1;
                node temp;
                temp.x = s;
                temp.step = STEP + 1;
                Q.push(temp);
            }
        }
        for(i = 0; i <= 9; i++) //十位
        {
            int s = X / 100 * 100 + i * 10 + X % 10;
            if(s != X && !vis[s] && judge_prime(s))
            {
                vis[s] = 1;
                node temp;
                temp.x = s;
                temp.step = STEP + 1;
                Q.push(temp);
            }
        }
        for(i = 0; i <= 9; i++) //百位
        {
            int s = X / 1000 * 1000 + i * 100 + X % 100;
            if(s != X && !vis[s] && judge_prime(s))
            {
                vis[s] = 1;
                node temp;
                temp.x = s;
                temp.step = STEP + 1;
                Q.push(temp);
            }
        }
        for(i = 1; i <= 9; i++) //千位
        {
            int s = i * 1000 + X % 1000;
            if(s != X && !vis[s] && judge_prime(s))
            {
                vis[s] = 1;
                node temp;
                temp.x = s;
                temp.step = STEP + 1;
                Q.push(temp);
            }
        }
    }
    cout << "Impossible" << endl;
    return ;
}

int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        while(!Q.empty())
            Q.pop();
        cin >> n >> m;
        memset(vis, 0, sizeof(vis));
        vis[n] = 1;
        node tmp;
        tmp.x = n;
        tmp.step = 0;
        Q.push(tmp);
        BFS();
    }
    return 0;
}

 

每搜索一步判断一下是否为素数。