简单搜索-Prime Path

题目：给定两个4位的素数(第一位不为0)，第一个为起始素数，第二个为目标素数。要求每次改变一位，使得该素数变为下一个素数，并最终达到目标素数。
策略：打素数表+BFS
打素数表的方法要学会！把倍数的全弄为非素数

#include<stdio.h>
#include<algorithm>
#include<vector>
#include<iostream>
#include<deque>

using namespace std;

int visited[10000];

int main() 
{
	int n;
	cin >> n;
	deque<int> Q;
	int target; int source;int tem[4];
	//打素数表
	int prime[10000];
	memset(prime, 1, sizeof(prime));
	prime[0] = 0;
	prime[1] = 0;
	for (int i = 2; i < 10000; i++) {
		for (int j = 2; j * i < 10000; j++) {
			prime[j*i] = 0;
		}
	}

	while (n--)
	{
		cin >> source >> target;
		Q.clear();
		memset(visited, 0, sizeof(visited));
		Q.push_back(source);
		visited[source] = 1;
		int time = 0;
		bool flag = false;
		while (!Q.empty())
		{
			if (flag)
				break;
			int size = Q.size();
			while (size--)
			{
				int cur = Q.front();
				Q.pop_front();
				if (cur == target) {
					cout << time << endl;
					flag = true;
					break;
				}
				tem[0] = cur % 10;
				tem[1] = cur / 10 % 10;
				tem[2] = cur / 100 % 10;
				tem[3] = cur / 1000;
				for (int i = 0; i < 4; i++) {
					int store = tem[i];
					for (int j = 0; j < 10; j++) {
						if (i == 3 && j == 0)
							continue;
						if (store != j)
						{
							int sum = 0;
							tem[i] = j;
							for (int k = 3; k>=0; k--)
							{
								sum=sum*10+tem[k];
							}
							if (prime[sum] && !visited[sum])
							{
								Q.push_back(sum);
								visited[sum] = 1;
							}
						}
						tem[i] = store;
					}
					
				}
			}
			time++;
		}
	}
	return 0;
}