【POJ 3126】Prime Path 素数打表+BFS

 Prime Path

Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31265   Accepted: 16993 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

 

题意：就是从一个数变到另外一个数，每次只能变一位，而且每一个数都必须是素数。如果能从一个数变到另外一个数，问你最少需要变多少次。反之，输出"Impossible"。

题解：既然要求每个数都是素数，我们先打一个素数表，然后广搜索即可。

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int maxn=10000+7;
int isprime[maxn];   //素数表
int vis[maxn];      //标记数组
int step[maxn];     //记录步数
int n,m;
void prime()       //素数打表 Eratosthenes筛 埃拉托斯特尼筛法
{
    memset(isprime,0,sizeof(isprime));
    for(int i=2;i*i<maxn;i++){
        if(!isprime[i]){
            for(int j=i*i;j<maxn;j+=i) isprime[j]=1;
        }
    }
    return ;
}

bool check(int x,int y)       //将x,y分为 千位 百位 十位 个位
{
    int x1,x2,x3,x4;
    int y1,y2,y3,y4;
    x1=x/1000;
    y1=y/1000;
    x2=(x-(x/1000)*1000)/100;
    y2=(y-(y/1000)*1000)/100;
    x4=x%10;
    y4=y%10;
    x3=(x-(x1*1000)-(x2*100)-x4)/10;
    y3=(y-(y1*1000)-(y2*100)-y4)/10;
    int num=0;
    if(x1==y1) num++;
    if(x2==y2) num++;
    if(x3==y3) num++;
    if(x4==y4) num++;
    if(num==3) return true;       //如果有三位相同 则仅有一位不同
    else return false;
}


int bfs(int n,int m)          
{
    memset(vis,0,sizeof(vis));
    memset(step,-1,sizeof(step));
    queue<int>q;
    while(!q.empty()) q.pop();
    q.push(n);
    vis[n]=1;
    step[n]=0;
    while(!q.empty()){
        int cur=q.front();
        if(cur==m) return 1;
        q.pop();
        for(int i=1000;i<maxn;i++){
            if(!vis[i]&&!isprime[i]&&check(cur,i)&&step[i]==-1){
                q.push(i);
                vis[i]=1;
                step[i]=step[cur]+1;
            }
        }
    }
    return 0;
}
int main()
{
    prime();
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d %d",&n,&m);
        if(bfs(n,m)) printf("%d\n",step[m]);
        else printf("Impossible\n");
    }
    return 0;
}