POJ 3126 Prime Path DFS

Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10352   Accepted: 5913 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 Source Northwestern Europe 2006

BFS，和数字结合还是很巧妙的

打个质数表和hash判重，有效提高效率。

#include <iostream>
#include <cstring>
using namespace std;

struct node{
	int k,step;
}queue[10000],temp;

bool b[10000]={0};
int hash[10000];
int i,j,k,n,end,fa,so;

int change(int x,int n,int k);
int bfs();

int main()
{
	for (i=2;i<5000;++i)
		if (!b[i]){
			j=i; k=j+j;
			while (k<10000){
				b[k]=1; k+=j;
			}
		}
	cin>>n;
	while (n--)
		cout<<bfs()<<endl;
	return 0;
}
int change(int x,int n,int k){
	int i,j,t2,t3,t1=1;
	if (n==1 && k==0) return 0;
	for (i=4;i>=n;--i) t1*=10;
	t3=x%(t1/10);
	t2=x/t1;
	t2=t2*10+k;
	t2=t2*t1/10+t3;
	if (!b[t2] && !hash[t2]) return t2;
	return 0;
}

int bfs(){
	int i,j,k,fa=0,so=0;
	memset(hash,0,sizeof(hash));
	cin>>queue[fa].k>>end;
	hash[queue[fa].k]=1;
	queue[fa].step=0;
	while (fa<=so){
		for (i=1;i<=4;++i)
			for (j=0;j<=9;++j){
				k=change(queue[fa].k,i,j);
				if (k){
					hash[k]=1;
					if (k==end)
						return queue[fa].step+1;
					queue[++so].k=k;
					queue[so].step=queue[fa].step+1;
				}
			}
		++fa;
	}
	return 0;
}

kdwycz的网站：  http://kdwycz.com/

kdwyz的刷题空间：http://blog.csdn.net/kdwycz