F - Prime Path

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

先用埃氏筛法筛出10000以内的素数，再分别对素数的每一位进行深搜，将接下来能够得到的素数放入队列

注意，千位上的数字不能替换为0

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f, N = 1e5 + 5;

bool is_prime[N];
int d[N], m, n;
char s[5];

void sieve(int n)
{
	for (int i = 2; i <= n; i++)
		is_prime[i] = 1;
	for (int i = 2; i <= n; i++) {
		for (int j = i * i; j <= n; j += i) {
			is_prime[j] = 0;
		}
	}
}

int bfs()
{
	memset(d, INF, sizeof d);
	queue<int> que;
	que.push(m);
	d[m] = 0;
	
	while (que.size()) {
		int x = que.front(); que.pop();
		if (x == n) {
			return d[n];
		}
		// 遍历数的四位 
		for (int i = 0; i < 4; i++) {
			sprintf(s, "%d", x);
			// 替换为 j 
			for (int j = 0; j <= 9; j++) {
				// 前缀0 
				if (i == 0 && j == 0) {
					continue;
				} 
				// 不是之前的数字 
				if (j + '0' != s[i]) {
					s[i] = j + '0';
					int nx = atoi(s);
					// 是素数 
					if (is_prime[nx] && d[nx] == INF) {
						que.push(nx);
						d[nx] = d[x] + 1;
					}
				}
			}
		} 
	}
}

int main(void)
{
	sieve(10000);
	int t;
	cin >> t;
	while (t--) {
		cin >> m >> n;
		cout << bfs() << endl;
	}
	
	return 0;
}