POJ 3126 Prime Path

题目链接：http://poj.org/problem?id=3126

Prime Path

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16242		Accepted: 9179

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。代码不难理解，直接上代码吧！

附上AC代码：

#include <cstdio>
#include <cmath>
#include <utility>
#include <queue>
#include <cstring>
#define pii pair<int, int>
#define mp make_pair
//#pragma comment(linker, "/STACK:102400000, 102400000")
using namespace std;
const int maxn = 10005;
bool is_prime[maxn]={true, true}, vis[maxn];
int n, m;

void filter(){
	int t = (int)sqrt(maxn+0.5);
	for (int i=2; i<=t; ++i)
		if (!is_prime[i])
			for (int j=i*i; j<maxn; j+=i)
				is_prime[j] = true;
}

void bfs(){
	queue<pii > q;
	q.push(mp(n, 0));
	memset(vis, false, sizeof(vis));
	vis[n] = true;
	while (!q.empty()){
		pii t = q.front();
		q.pop();
		if (t.first == m){
			printf("%d\n", t.second);
			return ;
		}
		int k = t.first%1000;
		for (int i=1000; i<10000; i+=1000)
			if (!is_prime[i+k] && !vis[i+k])
				q.push(mp(i+k, t.second+1)), vis[i+k]=true;
		k = t.first%100+t.first/1000*1000;
		for (int i=0; i<1000; i+=100)
			if (!is_prime[i+k] && !vis[i+k])
				q.push(mp(i+k, t.second+1)), vis[i+k]=true;
		k = t.first%10+t.first/100*100;
		for (int i=0; i<100; i+=10)
			if (!is_prime[i+k] && !vis[i+k])
				q.push(mp(i+k, t.second+1)), vis[i+k]=true;
		k = t.first/10*10;
		for (int i=1; i<10; i+=2)
			if (!is_prime[i+k] && !vis[i+k])
				q.push(mp(i+k, t.second+1)), vis[i+k]=true;
	}
	printf("Impossible\n");
}

int main(){
	#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
	filter();
	int T;
	scanf("%d", &T);
	while (T--){
		scanf("%d%d", &n, &m);
		bfs();
	}
	return 0;
}