总统素数

1. https://vjudge.net/contest/65959#problem/F
2. 
   
3. 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.
   
4. 
   
5. 将一个素数变成另一个素数，且过程均为素数 
6. 
   
7. #include <iostream>  
8. #include <algorithm>  
9. #include <cstring>  
10. #include <cstdio>  
11. #include <math.h>  
12. #include <cstdlib>  
13. #include <queue>  
14. using namespace std;  
15.   
16. #define N 10100  
17. int prime[N];  
18.   
19. struct node  ///BFS记录步数，习惯用结构体，比较清晰，话说用数组我还不一定写的出来啊....  
20. {  
21.     int x,step;  
22. };  
23.   
24. void init() ///打N以内的素数表，prime[i]=0为素数。  
25. {  
26.     int i,j;  
27.     memset(prime,0,sizeof(prime));  
28.     prime[1]=1;  
29.     for(i=2; i<N; i++)  
30.     {  
31.         if(prime[i]==0)  
32.         {  
33.             for(j=2; j*i<N; j++)  ///傻逼XX的这里的J是从２开始的。这么简单的地方也会错，唉．．．．  
34.                 prime[j*i]=1;  
35.         }  
36.     }  
37. }  
38.   
39. int BFS(int s,int e)  
40. {  
41.     int vis[N],num;　　///vis[N]用来标记是否查找过  
42.     memset(vis,0,sizeof(vis));  
43.     queue<node>Q;  ///申请队列。  
44.     node p,q;    
45.     p.x=s;     ///将起始值赋值给P  
46.     p.step=0;  
47.     vis[s]=1;  
48.     Q.push(p);  ///将p压入队列  
49.     while(!Q.empty())  ///当队列不为空时  
50.     {  
51.         p=Q.front();  ///取队首  
52.         Q.pop();    ///清队首  
53.         if(p.x==e)    ///若找到终止值 返回步数，  
54.             return p.step;   
55.   
56.         int t[5];  
57.         t[1]=p.x/1000;   ///记录千位数  
58.         t[2]=p.x/100%10;  ///记录百位数  
59.         t[3]=p.x/10%10;   ///记录十位  
60.         t[4]=p.x%10;   ///记录各位  
61.      
62.         for(int i=1;i<=4;i++)  
63.         {  
64.             int temp=t[i];    ///这里特别注意，每次只能变换一位数，这里用来保存该变换位的数，变换下一位数时，该位数要恢复  
65.             for(int j=0;j<10;j++)  
66.             {  
67.                 if(t[i]!=j)  
68.                 {  
69.                     t[i]=j;  ///t[i]要改变  
70.                     num=t[1]*1000+t[2]*100+t[3]*10+t[4];  
71.                 }  
72.                 if(num>=1000 && num<=9999 && !vis[num] && !prime[num])   ///判断该4位数是否满足条件，  
73.                 {  
74.                     q.x=num;  
75.                     q.step=p.step+1;  ///若满足，步数加1，压入队列，标记...  
76.                     Q.push(q);  
77.                     vis[num]=1;  
78.                 }  
79.             }  
80.             t[i]=temp;  ///恢复  
81.         }  
82.     }  
83.     return -1;  
84. }  
85.   
86. int main()  
87. {  
88.     int n,a,b,ans;  
89.     init();  
90.     scanf("%d",&n);  
91.     while(n--)  
92.     {  
93.         scanf("%d%d",&a,&b);  
94.         ans=BFS(a,b);  
95.         if(ans!=-1)  
96.             printf("%d\n",ans);  
97.         else  
98.             printf("Impossible\n");  
99.     }  
100. }