Description
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
— I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.
Now, the minister of finance, who had been eavesdropping, intervened.
— No unnecessary expenditure, please! I happen to know that the price of a digit is one pound.
— Hmm, in that case I need a computer program to minimize the cost. You don't know some very cheap software gurus, do you?
— In fact, I do. You see, there is this programming contest going on... Help the prime minister to find the cheapest prime path between any two given four-digit primes! The first digit must be nonzero, of course. Here is a solution in the case above.
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
— I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.
Now, the minister of finance, who had been eavesdropping, intervened.
— No unnecessary expenditure, please! I happen to know that the price of a digit is one pound.
— Hmm, in that case I need a computer program to minimize the cost. You don't know some very cheap software gurus, do you?
— In fact, I do. You see, there is this programming contest going on... Help the prime minister to find the cheapest prime path between any two given four-digit primes! The first digit must be nonzero, of course. Here is a solution in the case above.
1033The cost of this solution is 6 pounds. Note that the digit 1 which got pasted over in step 2 can not be reused in the last step – a new 1 must be purchased.
1733
3733
3739
3779
8779
8179
Input
One line with a positive number: the number of test cases (at most 100). Then for each test case, one line with two numbers separated by a blank. Both numbers are four-digit primes (without leading zeros).
Output
One line for each case, either with a number stating the minimal cost or containing the word Impossible.
Sample Input
3 1033 8179 1373 8017 1033 1033
Sample Output
6 7 0
思路很简单,打一个素数表,BFS每一位即可。代码如下:
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#define m 10000
using namespace std;
bool prime[m]={false};
void Getprime()
{
prime[0]=prime[1]=0;
prime[2]=1;
for(int i=3;i<=m;++i) prime[i]=i%2==0?0:1;
int t=sqrt(m);
for(int i=3;i<=t;++i)
{
if(prime[i])
{
for(int j=i*i;j<=m;j+=2*i) prime[j]=0;
}
}
}
typedef struct node
{
int a,s;
node(int aa=0,int ss=0):a(aa),s(ss){}
}node;
bool r[10000];
node x,y;
void BFS()
{
node p,s;
queue<node> q;
q.push(x);
while(!q.empty())
{
int a,b,c;
p=q.front(),q.pop();
if(p.a==y.a)
{
cout<<p.s<<endl;
return;
}
//千位
c=p.a%1000;
for(int i=1;i<=9;++i)
{
a=i*1000+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//百位
b=p.a/1000*1000,c=p.a%100;
for(int i=0;i<=9;++i)
{
a=b+i*100+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//十位
b=p.a/100*100,c=p.a%10;
for(int i=0;i<=9;++i)
{
a=b+i*10+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//个位
b=p.a/10*10;
for(int i=1;i<=9;++i)
{
a=b+i;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
#include<cstring>
#include<cmath>
#include<queue>
#define m 10000
using namespace std;
bool prime[m]={false};
void Getprime()
{
prime[0]=prime[1]=0;
prime[2]=1;
for(int i=3;i<=m;++i) prime[i]=i%2==0?0:1;
int t=sqrt(m);
for(int i=3;i<=t;++i)
{
if(prime[i])
{
for(int j=i*i;j<=m;j+=2*i) prime[j]=0;
}
}
}
typedef struct node
{
int a,s;
node(int aa=0,int ss=0):a(aa),s(ss){}
}node;
bool r[10000];
node x,y;
void BFS()
{
node p,s;
queue<node> q;
q.push(x);
while(!q.empty())
{
int a,b,c;
p=q.front(),q.pop();
if(p.a==y.a)
{
cout<<p.s<<endl;
return;
}
//千位
c=p.a%1000;
for(int i=1;i<=9;++i)
{
a=i*1000+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//百位
b=p.a/1000*1000,c=p.a%100;
for(int i=0;i<=9;++i)
{
a=b+i*100+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//十位
b=p.a/100*100,c=p.a%10;
for(int i=0;i<=9;++i)
{
a=b+i*10+c;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
//个位
b=p.a/10*10;
for(int i=1;i<=9;++i)
{
a=b+i;
s.a=a,s.s=p.s+1;
if(prime[a]&&!r[a])
{
r[a]=true;
q.push(s);
}
}
}
return;
}
int main()
{
Getprime();
int t;
cin>>t;
while(t--)
{
memset(r,false,sizeof(r));
cin>>x.a>>y.a;
BFS();
}
return 0;
}
}
return;
}
int main()
{
Getprime();
int t;
cin>>t;
while(t--)
{
memset(r,false,sizeof(r));
cin>>x.a>>y.a;
BFS();
}
return 0;
}