poj 3126 简单bfs

      Prime Path Prime PathTime Limit: 1000MS Memory Limit: 65536K
Total Submissions: 4686 Accepted: 2735


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.
1033
1733
3733
3739
3779
8779
8179
The 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.

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

 

 

 

 

 

 

 

 

题目意思：

 

给你a，b。a，b都是4位数的素数，要求每一次变化只能变一个数字而且变化后的数也是素数，问你a经过变化后能否变成b 。

 

 

代码如下：

 

 

#include<iostream> #include<queue> using namespace std; bool prime[10000]; int first, end; bool vis[10000]; int step[10000]; int bfs() { for(int i = 0; i < 10000; i ++) { vis[i] = false; step[i] = 0; } queue<int>q; q.push(first); vis[first] = true; step[first] = 0; while (!q.empty()) { int t_s= q.front(); q.pop(); int str[4]; str[0] = t_s/1000;//千位 str[1] = (t_s%1000)/100;//百位 str[2] = (t_s%100)/10;//十位 str[3] = t_s%10;//个位 int k = 1; for(int i = 3; i >= 0; i --) { if(i != 3) k *= 10; for(int j = -str[i]; j < 10-str[i]; j ++) { int temp = t_s+k*j; if (prime[temp] && vis[temp]==false && temp>=1000) { vis[temp] = true; step[temp] = step[t_s]+1; if(temp == end) return step[temp]; q.push(temp); } } } vis[t_s] = true; } return 0; } bool is_prime(int x) { for(int i = 2; i*i <= x; i ++) if(x%i == 0) return false; return true; } int main() { int t; scanf("%d", &t); while (t--) { memset(prime, false,sizeof(prime)); for(int i = 1000; i < 10000; i ++) if (is_prime(i)) prime[i] = true; scanf("%d%d", &first, &end); if(first == end) printf("0/n"); else printf("%d/n", bfs()); } return 0; }