POJ - 3126

题目意思就是给你n对数，让你计算从一个数变成另一个数需要几步，其中一次只能变换个十百千上中的一位，并且变换前后的数必须都是素数

思路：先打表，然后bfs搜索每一位数

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;

int prime[10101];
int book[10101];
int n,m;
int flag;

struct data
{
    int num,s;
}q;

void p()    // 打表
{
    prime[0] = prime[1] = 1;
    for(int i=2; i<=10001; i++)
    {
        if(prime[i] == 0)
        {
            for(int j=i*2; j<=10000; j+=i)
                prime[j] = 1;
        }
    }
    /*for(int i=1000; i<=9999; i++)
        if(prime[i] == 0)
            printf("%d ",i);

    printf("\n\n");*/
}

void bfs(int nn)
{
    queue<data>Q;
    data now,temp;

    q.num = nn;
    q.s = 0;
    book[nn] = 1;
    Q.push(q);

    while(!Q.empty())
    {
        now = Q.front();
        Q.pop();

        //printf("%d\n",now.num);
        if(now.num == m)
        {
            flag = 1;
            printf("%d\n",now.s);
            break;
        }



        int t1,t2,t3,t4;

        t1 = now.num / 1000;
        t2 = now.num / 100 % 10;
        t3 = now.num / 10 % 10;
        t4 = now.num % 10;
        // 四个for循环代表四个位置做广搜
        for(int i=0; i<=9; i++)
        {
            if(i == t1)
                continue;
            temp.num = i*1000 + t2 *100 + t3*10 + t4;
            //printf("******%d\n",temp.num);
            if(temp.num>1000 && book[temp.num]==0 && prime[temp.num] == 0)
            {
                temp.s = now.s + 1;
                book[temp.num] = 1;
                Q.push(temp);
            }
        }

        for(int i=0; i<=9; i++)
        {
            if(i==t2)
                continue;
            temp.num = t1*1000 + i*100 + t3*10 + t4;
            if(temp.num>1000 && book[temp.num] == 0 && prime[temp.num] == 0)
            {
                temp.s = now.s + 1;
                book[temp.num] = 1;
                Q.push(temp);
            }
        }

        for(int i=0; i<=9; i++)
        {
            if(i==t3)
                continue;
            temp.num = t1*1000 + t2*100 + i*10 + t4;
            if(temp.num>1000 && book[temp.num] == 0 && prime[temp.num] == 0)
            {
                temp.s = now.s + 1;
                book[temp.num] = 1;
                Q.push(temp);
            }
        }

        for(int i=0; i<=9; i++)
        {
            if(i==t4)
                continue;
            temp.num = t1*1000 + t2*100 + t3*10 + i;
            if(temp.num>1000 && book[temp.num] == 0 && prime[temp.num] == 0)
            {
                temp.s = now.s + 1;
                book[temp.num] = 1;
                Q.push(temp);
            }
        }

    }
}

int main()
{
    memset(prime,0,sizeof(prime));
    p();
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(book,0,sizeof(book));
        scanf("%d %d",&n,&m);
        flag = 0;
        if(n == m)
            printf("0\n");
        else
            bfs(n);
    }
}