Prime Path
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10692 | Accepted: 6089 |
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
Source
解题报告
BFS的题,一开始不知道哪里错了,调了一会就不调了,回宿舍重新敲1A。。。
题意很容易理解,从一个数到另一个数的最短路径,要求走的是素数。。。
预判一下素数,接下就是BFS的事
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
int s,e;
int is_prime[10001],vis[10001];
int change(int x,int i,int j)
{
if(i==1)return x/10*10+j;
else if(i==2)return x/100*100+j*10+x%10;
else if(i==3)return x/1000*1000+j*100+x%100;
else if(i==4)return j*1000+x%1000;
}
struct node
{
int x,step;
};
void bfs(int s,int e)
{
memset(vis,0,sizeof(vis));
queue<node>Q;
node now,next;
now.x=s;
now.step=0;
vis[s]=1;
Q.push(now);
while(!Q.empty())
{
now=Q.front();
Q.pop();
if(now.x==e)
{
cout<<now.step<<endl;
return ;
}
for(int i=1;i<=4;i++)
{
for(int j=0;j<10;j++)
{
if(!(i==4&&j==0))
{
next.x=change(now.x,i,j);
if(!vis[next.x]&&!is_prime[next.x])
{
next.step=now.step+1;
vis[next.x]=1;
Q.push(next);
}
}
}
}
}
}
int main()
{
is_prime[0]=1;
is_prime[1]=1;
for(int i=2;i<10000;i++)
{
if(!is_prime[i])
for(int j=i*i;j<10000;j+=i)
is_prime[j]=1;
}
int n;
cin>>n;
while(n--)
{
cin>>s>>e;
bfs(s,e);
}
}