poj 3126 Prime Path

给出两个素数a,b，要求a每次改变一位数，最后要几步才能变成b，a每次改变完也必须是素数

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int maxn=10000;
int prime[maxn];
bool flag[maxn];
int pcnt;
int queue[maxn],front,rear,first;
int s,e;
char tmp[6];
bool used[maxn];

void get_prime(){
	memset(flag,false,sizeof(flag));
	for(int i=2;i<=maxn;i++){
		if(!flag[i])for(int j=i<<1;j<=maxn;j+=i)flag[j]=true;
	}
	pcnt=0;
	for(int i=1000;i<=maxn;i++)if(!flag[i])prime[pcnt++]=i;
	//for(int i=2;i<=100;i++)if(!flag[i])printf("%d ",i);printf("\n%d\n",pcnt);
}

bool check(int x){
	for(int i=0;i<pcnt;i++)if(x==prime[i])return true;
	return false;
}

int bfs(){
	front=rear=0;
	queue[rear++]=s;
	queue[rear++]=0;
	used[s]=true;
	while(front<rear){
		first=queue[front++];
		int step=queue[front++];
		if(first==e)return step;
		sprintf(tmp,"%d",first);
		//puts(tmp);
		for(int i=0;i<4;i++){
			char c=tmp[i];
			for(char j=i==0?'1':'0';j<='9';j++){
				if(j==c)continue;
				tmp[i]=j;
				sscanf(tmp,"%d",&first);
				if(check(first) && !used[first]){
					used[first]=true;
					queue[rear++]=first;
					queue[rear++]=step+1;
				}
			}
			tmp[i]=c;
		}
	}
	return -1;
}

int main(){
	get_prime();
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&s,&e);
		memset(used,false,sizeof(used));
		int ans=bfs();
		printf("%d\n",ans);
	}
}