Description
![](https://i-blog.csdnimg.cn/blog_migrate/d37b8f74a1ac07badfe42aa484f8ebcb.jpeg)
— 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
四位数,每次改变一位上的数,使其变成素数,直到达到要求,求改变的步数
分析:
用宽搜就行
代码:
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
int a[10000],b[10000];
struct num
{
int s,l;
};
void bfs(int n,int m)
{
num v,kk;
int i,sum=0,temp;
v.s=n;
v.l=0;
queue<num>gg;
gg.push(v);
while(!gg.empty())
{
v=gg.front();
if(v.s==m){cout<<v.l<<endl;return ;}
gg.pop();
for(i=1;i<10;i++)
{
temp=v.s%1000+i*1000;
if(b[temp]==0&&!a[temp])
{
kk.s=temp;
kk.l=v.l+1;
b[temp]=1;
gg.push(kk);
}
}
for(i=0;i<10;i++)
{
temp=v.s/1000*1000+v.s%100+i*100;
if(b[temp]==0&&!a[temp])
{
kk.s=temp;
kk.l=v.l+1;
b[temp]=1;
gg.push(kk);
}
}
for(i=0;i<10;i++)
{
temp=v.s/100*100+v.s%10+i*10;
if(b[temp]==0&&!a[temp])
{
kk.s=temp;
kk.l=v.l+1;
b[temp]=1;
gg.push(kk);
}
}
for(i=0;i<10;i++)
{
temp=v.s/10*10+i;
if(b[temp]==0&&!a[temp])
{
kk.s=temp;
kk.l=v.l+1;
b[temp]=1;
gg.push(kk);
}
}
}
cout<<"Impossible"<<endl;
return;
}
int main()
{
int t,k,n,m,i,j;
for(i=2;i<10000;i++)
{
if(a[i]==0)
{
for(j=i+1;j<10000;j++)
{
if(j%i==0)a[j]=1;
}
}
}
cin>>t;
for(k=0;k<t;k++)
{
memset(b,0,sizeof(b));
cin>>n>>m;
bfs(n,m);
}
}
感受:
挺水的