POJ - 3126 Prime Path（BFS， 素数筛法）

http://poj.org/problem?id=3126

直接枚举所有有可能的素数，有点暴力，还没想到更好的方法。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int MAX_N = 10000, INF = 0x3f3f3f3f;
int T;
int prime[MAX_N];
bool isprime[MAX_N];
int sieve(int n)
{
	int p = 0;
	for(int i = 0; i <= n; i++) isprime[i] = true;
	isprime[0] = isprime[1] = false;
	for(int i = 2; i <= n; i++)
		if(isprime[i])
		{
			prime[p++] = i;
			for(int j = 2*i; j <= n; j+=i)
				isprime[j] = false;
		}
	return p;
}
queue<int> que;
int d[MAX_N];
int bfs(int ns, int ne)
{
	while(que.size()) que.pop();
	memset(d, 0x3f, sizeof(d));
	d[ns] = 0;
	que.push(ns);
	while(que.size())
	{
		int n = que.front(); que.pop();
		if(n == ne)
			return d[ne];
		int nn[4], t = n;
		for(int i = 3; i >= 0; i--)
			nn[i] = t % 10, t /= 10;
		for(int i = 0; i < 4; i++)
			for(int j = 0; j <= 9; j++)
			{
				if(i == 0 && j == 0 || j == nn[i]) continue;
				int t = nn[i];
				nn[i] = j;
				int next = 1000*nn[0] + 100*nn[1] + 10*nn[2] + nn[3];
				if(isprime[next] && d[next]==INF)
				{
					que.push(next);
					d[next] = d[n] + 1;
				}
				nn[i] = t;
			}
	}
	return -1;
}
int main()
{
	sieve(MAX_N-1);
	scanf("%d", &T);
	while(T--)
	{
		int n1, n2;
		scanf("%d%d", &n1, &n2);
		int ans = bfs(n1, n2);
		printf(ans == -1 ? "Impossible\n" : "%d\n", ans);
	}
	return 0;
}