关于素数:
一直WR,一直WR
原来求素数的时候没有写<=而是写的<号
for(int i = 2; i*i <= n; i++)
<span style="white-space:pre"> </span>if(n % i == 0) 不是素数 break;
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> P;
//#define LOCAL
#define INF 0x3f3f3f3f
#define MAX_N 10000
int vis[MAX_N];//记录是否被访问
int prime[MAX_N];//标记所有的素数
int ANS[MAX_N];//记录操作次数的数组
int bfs(int A, int B)
{
memset(vis, 0, sizeof(vis));
memset(ANS, 0, sizeof(ANS));
queue<int> que;
que.push(A);
vis[A] = INF;
ANS[A] = 0;
while(!que.empty())
{
int now = que.front();
que.pop();
if(now == B) {
return ANS[now];
}
int a1 = now / 1000 % 10;
int a2 = now / 100 % 10;
int a3 = now / 10 % 10;
int a4 = now % 10;
int temp;
//对每一位的数字进行搜索
for(int i = 1; i < 10; i++) {
temp = i * 1000 + a2 * 100 + a3 * 10 + a4;
if(temp == now) continue;
if(prime[temp] != 0 && vis[temp] != INF) {
//是素数
que.push(temp);
ANS[temp] = ANS[now] + 1;//记录操作次数
vis[temp] = INF;
}
}
for(int i = 0; i < 10; i++)
{
temp = a1 * 1000 + i * 100 + a3 * 10 + a4;
if(temp == now) continue;
if(prime[temp] != 0 && vis[temp] != INF) {
que.push(temp);
ANS[temp] = ANS[now] + 1;
vis[temp] = INF;
}
}
for(int i = 0; i < 10; i++)
{
temp = a1 * 1000 + a2 * 100 + i * 10 + a4;
if(temp == now) continue;
if(prime[temp] != 0 && vis[temp] != INF) {
que.push(temp);
ANS[temp] = ANS[now] + 1;
vis[temp] = INF;
}
}
for(int i = 0; i < 10; i++) {
temp = a1 * 1000 + a2 * 100 + a3 * 10 + i;
if(temp == now) continue;
if(prime[temp] != 0 && vis[temp] != INF) {
que.push(temp);
ANS[temp] = ANS[now] + 1;
vis[temp] = INF;
}
}
}
return -1;
}
int main()
{
#ifdef LOCAL
freopen("b:\\data.in.txt", "r", stdin);
#endif
int n;
cin >> n;
//打表所有的素数
for(int i = 1000; i < 10000; i++){
bool flag = 0;
for(int j = 2; j <= (int)sqrt((double)i); j++) {//就这儿错了,wr了一下午
if(i % j == 0) {
flag = 1;//不是素数
break;
}
}
if(!flag)
prime[i]++;
}
while(n--)
{
int A, B;
cin >> A >> B;
int ans = bfs(A, B);
if(ans == -1)
cout << "Impossible" << endl;
else
cout << ans << endl;
}
return 0;
}