POJ 3126 Prime Path(BFS)
来源:互联网 发布:trustdata移动大数据 编辑:程序博客网 时间:2024/05/16 07:46
原题
Prime Path
Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u
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
31033 8179
1373 8017
1033 1033
Sample Output
67
0
题意
从一个素数变化为另一个素数,只能以这样的方式变化:
1.一次之改变某一位上的数字
2.改变之后的数字也必须是素数
求这种改变的次数,若无法达到要求,则输出“Impossible”
涉及知识及算法
素数筛选 BFS深度搜索
代码
#include <iostream>#include <queue>#include <cstring>#include <cstdio>using namespace std;int p[10000]; //素数集合int b[10000]; //标记是否访问过bool pb[10000]; //记录递归深度int n2;queue<int> q;void GetPrime(){ memset(p,0,sizeof(p)); for(int i=2;i<5000;i++) { for(int j=2;i*j<10000;j++) { //cout<<i<<"*"<<j<<"="<<i*j<<"是合数"<<endl; p[i*j]=1; //标记为合数 } }}void BFS(int a){ if(a==n2||q.empty()) return; q.pop(); for(int i=0;i<10;i++) { if(p[a-a%10+i]==0&&pb[a-a%10+i]==0) { q.push(a-a%10+i); pb[a-a%10+i]=1; b[a-a%10+i]=b[a]+1; } if(p[a-a/10%10*10+i*10]==0&&pb[a-a/10%10*10+i*10]==0) { q.push(a-a/10%10*10+i*10); pb[a-a/10%10*10+i*10]=1; b[a-a/10%10*10+i*10]=b[a]+1; } if(p[a-a/100%10*100+i*100]==0&&pb[a-a/100%10*100+i*100]==0) { q.push(a-a/100%10*100+i*100); pb[a-a/100%10*100+i*100]=1; b[a-a/100%10*100+i*100]=b[a]+1; } if(i>0&&p[a-a/1000%10*1000+i*1000]==0&&pb[a-a/1000%10*1000+i*1000]==0) { q.push(a-a/1000%10*1000+i*1000); pb[a-a/1000%10*1000+i*1000]=1; b[a-a/1000%10*1000+i*1000]=b[a]+1; } } BFS(q.front());}int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int kase,n1; cin >>kase; GetPrime(); while(kase--) { memset(pb,0,sizeof(pb)); memset(b,0,sizeof(b)); cin>>n1>>n2; q.push(n1); pb[n1]=1; BFS(n1); if(b[n2]||n1==n2)cout<<b[n2]<<endl; else cout<<"Impossible"<<endl; while(!q.empty()) { q.pop(); } } return 0;}
阅读全文
0 0
- POJ 3126 Prime Path BFS
- POJ 3126 Prime Path bfs
- POJ 3126 Prime Path BFS
- poj-3126-Prime Path-bfs
- POJ 3126 Prime Path (BFS)
- poj 3126 Prime Path(bfs)
- poj 3126 Prime Path bfs
- [bfs]poj 3126 Prime Path
- BFS-POJ-3126-Prime Path
- poj 3126 Prime Path(bfs)
- POJ 3126-Prime Path(BFS)
- POJ 3126 Prime Path(BFS)
- poj-3126-Prime Path-BFS
- poj 3126 Prime Path bfs
- poj 3126 Prime Path(BFS)
- poj 3126 Prime Path bfs
- POJ - 3126 Prime Path(BFS)
- poj 3126 Prime Path (bfs)
- 使用Intent进行活动间的跳转
- 用Apache Spark进行大数据处理——第二部分:Spark SQL
- Java基础(五)----内部类总结
- Hinton Neural Networks课程笔记1d:一个简单的机器学习实例
- 文章标题
- POJ 3126 Prime Path(BFS)
- 19.S5PV210串口基本操作
- 数据结构(C++语言版)第三版pdf
- 【ios】xcode等开发资源下载官网网址
- EditText保留小数位数的问题
- 判断一棵二叉树是否为搜索二叉树、完全二叉树、平衡二叉树(java)
- driver: linux2.6 内核模块导出函数实例(EXPORT_SYMBOL)
- 理解mysql_序言
- myeclipse出现Deployment failed错误