搜索就是每位的0到9个数字
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <math.h>
#include <queue>
using namespace std;
const int Max = 10005;
int prime[Max], dis[Max];
bool visit[Max];
queue<int> Q;
void funprime()
{
for (int num = 1000; num < 10000; ++num) {
prime[num] = true;
for (int i = 2; i <= sqrt(num); ++i)
if (num % i == 0) {
prime[num] = false;
break;
}
}
}
int numtoi(int num, int n, int k)
{
int a[4], result;
for (int i = 0; i < 4; ++i) {
a[i] = num % 10;
num = num / 10;
}
a[n] = k;
result = 0;
for (int i = 0; i < 4; ++i)
result += a[i] * pow(10, i);
return result;
}
int dfs(int left, int right)
{
while (!Q.empty()) Q.pop();
Q.push(left);
visit[left] = true;
while (!Q.empty()) {
int now = Q.front();
Q.pop();
if (now == right) return 1;
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 10; ++j) {
if (i == 3 && j == 0) continue;
int next = numtoi(now, i, j);
if (prime[next] && !visit[next]) {
dis[next] = dis[now] + 1;
Q.push(next);
visit[next] = true;
}
}
}
}
return 0;
}
int main()
{
int n, left, right;
funprime();
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; ++i) {
memset(visit, false, sizeof(visit));
memset(dis, 0, sizeof(dis));
scanf("%d%d", &left, &right);
if (dfs(left, right))
printf("%d\n", dis[right]);
else
printf("Impossible\n");
}
}
}
做的比较麻烦