link.
思路:
先筛出1000-10000的素数,然后宽搜进行处理;
宽搜时,从1000-10000的素数里,与a有一位不同的素数入队,然后重复操作即可,同样用d数组记录是否被搜过 + 步数。
代码:
#include <iostream>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#define me memset
using namespace std;
typedef long long ll;
const int N = 10010;
const int null = 0x3f3f3f3f;
int T,a,b;
int d[N];
int primes[N],cnt;
bool st[N];
void get_primes()
{
for (int i = 2; i <= 10000; i ++ )
{
if (st[i]) continue;
primes[cnt ++ ] = i;
for (int j = i + i; j <= 10000; j += i)
st[j] = true;
}
}
bool check(int x,int y)
{
int usa = 0;
while(x && y)
{
int i = x % 10,j = y % 10;
if(i != j) usa ++;
x /= 10;
y /= 10;
}
// cout << usa << endl;
if(usa == 1) return true;
else return false;
}
int bfs()
{
queue<int> q;
me(d,-1,sizeof d);
q.push(a);
d[a] = 0;
while(q.size())
{
int t = q.front();
q.pop();
for(int i = 168;i < cnt ;i ++)
{
if(check(primes[i],t) && d[primes[i]] == -1)
{
q.push(primes[i]);
d[primes[i]] = d[t] + 1;
}
}
}
return d[b];
}
int main()
{
cin >> T;
get_primes();
// for(int i = 0;i < cnt;i ++) cout << primes[i] << endl;
// cout << cnt << endl;
// cout << primes[168] << endl;
while(T --)
{
cin >> a >> b;
if(a == b)
{
cout << "0" << endl;
continue;
}
// check(a,b);
if(bfs()) cout << d[b] << endl;
else cout << "Impossible" << endl;
}
return 0;
}