Prime Path

 

Language:Default Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 17886   Accepted: 10073 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 Source Northwestern Europe 2006 #include<iostream> #include<cstring> #include<cmath> #include<queue> using namespace std; const int N = 100000; int n,m; int vis[N]; struct node { int x; int step; }; queue<node> Q; bool judge(int num) { for(int i = 2;i <= (int)sqrt(num);i++) if(num%i == 0) return false; return true; } void bfs() { int e,sp,num; vis[n] = 1; node tmp; tmp.x = n; tmp.step = 0; Q.push(tmp); while(!Q.empty()) { tmp = Q.front(); e = tmp.x; sp = tmp.step; Q.pop(); if(e == m) { cout << sp << endl; return ; } for(int i = 1;i <= 9;i += 2) { num = e/10*10 + i; if(num != e && !vis[num] && judge(num)) { vis[num] = 1; node temp; temp.x = num; temp.step = sp + 1; Q.push(temp); } } for(int i = 0;i <= 9;i++) { num = e/100*100 + i*10 + e%10; if(num != e && !vis[num] && judge(num)) { vis[num] = 1; node temp; temp.x = num; temp.step = sp + 1; Q.push(temp); } } for(int i = 0;i <= 9;i++) { num = e/1000*1000 + i*100 + e%100; if(num != e && !vis[num] && judge(num)) { vis[num] = 1; node temp; temp.x = num; temp.step = sp + 1; Q.push(temp); } } for(int i = 1;i <= 9;i++) { num = i*1000 + e%1000; if(num != e && !vis[num] && judge(num)) { vis[num] = 1; node temp; temp.x = num; temp.step = sp + 1; Q.push(temp); } } } cout << "Impossible" << endl; return ; } int main() { int t; cin >> t; while(t--) { while(!Q.empty()) Q.pop(); cin >> n >> m; memset(vis,0,sizeof(vis)); bfs(); } return 0; }