Prime Path 变素数问题(bfs)
来源:互联网 发布:淘宝详情页设计多少钱 编辑:程序博客网 时间:2024/05/01 03:46
点击打开链接
//变 素数问题 广搜也要记得标记 ,要不然重复的元素会压到队列 筛素数
Problem 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
31033 81791373 80171033 1033
Sample Output
670
#if 0#include<iostream>#include<cstring>#include<queue>#include<cmath>using namespace std;int prime[10000];bool vis[10000];void goprime() //dabiao{prime[0]=prime[1]=0;prime[2]=1;for(int i=3; i<=10000; i++){if(i%2==0){prime[i]=0;}else{prime[i]=1;}}int k=sqrt(10000);for(int i=2; i<=k; i++){if(prime[i])for(int j=i*i; j<=10000; j+=2*i){prime[j]=0;}}}struct go{int x,t;}a,b;void bfs(){queue<go> q;q.push(a);while(!q.empty()){go it;it=q.front();q.pop(); if(it.x==b.x){cout<<it.t<<endl;return;}int x1,x2,x3,x4;x1=it.x/1000;x2=it.x%1000/100;x3=it.x%100/10;x4=it.x%10;go its;for(int i=1; i<10; i++){if(x1!=i){int x=i*1000+x2*100+x3*10+x4;if(prime[x] && !vis[x]){vis[x]=1;its.x=x;its.t=it.t+1;q.push(its);}}}for(int i=0; i<10; i++){if(x2!=i){int x=x1*1000+i*100+x3*10+x4;if(prime[x] && !vis[x]){vis[x]=1;its.x=x;its.t=it.t+1;q.push(its);}}}for(int i=0; i<10; i++){if(x3!=i){int x=x1*1000+x2*100+i*10+x4;if(prime[x] && !vis[x]){vis[x]=1;its.x=x;its.t=it.t+1;q.push(its);}}}for(int i=0; i<10; i++){if(x4!=i){int x=x1*1000+x2*100+x3*10+i;if(prime[x] && !vis[x]){vis[x]=1;its.x=x;its.t=it.t+1;q.push(its);}}}} cout<<"Impossible"<<endl;return;}int main(){int n;cin>>n;goprime();while(n--){memset(vis,0,sizeof(vis));cin>>a.x>>b.x;a.t=b.t=0;vis[a.x]=1;bfs();}}#endif
阅读全文
0 0
- Prime Path 变素数问题(bfs)
- Prime Path BFS 打表求素数
- POJ 3126 Prime Path (素数筛选+bfs)
- POJ 3126 Prime Path【素数+bfs】
- poj3262 Prime Path 素数打表+bfs
- Prime Path(素数筛+BFS)
- POJ 3126 Prime Path(BFS + 素数判定)
- POJ3126 Prime Path(素数判断+bfs)
- POJ 1326 Prime Path(BFS+素数判断)
- Prime Path(bfs最短步数问题)
- POJ 3126 Prime Path BFS 广度优先搜索 素数
- POJ 3126 && HDU 1973 Prime Path (素数表 + BFS)
- POJ - 3126 Prime Path(BFS, 素数筛法)
- poj 3126 Prime Path (bfs+筛素数)
- POJ 3126 Prime Path(素数,BFS最短路)
- F - Prime Path POJ 3126 筛选素数+bfs
- POJ 3126 Prime Path(BFS + 素数打表)
- POJ 3126 Prime Path(bfs+素数打表)
- 睡不着
- C语言单向链表的实现
- spring实战-显式装配bean
- 莫比乌斯反演
- 注解,泛型,反射的小应用:生成增删改查SQL的语句
- Prime Path 变素数问题(bfs)
- Android 开发遇坑备忘录(二)
- 【反向代理】跨域解决方式之一——反向代理
- 树莓派做web服务器(nginx、Apache)
- 初识Linux操作系统
- asdasdasd
- [BZOJ 1059] 矩阵游戏 Hungary算法
- MySQL存储引擎MyISAM与InnoDB的优劣
- 蚂蚁变大象:浅谈常规网站是如何从小变大的