F - Prime Path POJ 3126 筛选素数+bfs
来源:互联网 发布:詹姆斯总决赛所有数据 编辑:程序博客网 时间:2024/05/18 02:38
F - Prime Path
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice POJ 3126
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
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>#include<queue>using namespace std;const int maxn=9999;const int inf=999999;int prim[maxn];int isprim[maxn];bool vis[maxn];int d[maxn];int num=0;bool pan(int a,int b){ int ans=0; while(a) { int k=a%10; int m=b%10; if(k!=m)ans++; a/=10; b/=10; } return ans==1;}int ans;void bfs(int s,int stop)//搜索{ queue<int> q; memset(vis,0,sizeof(vis)); q.push(s); vis[s]=true; d[s]=0; while(!q.empty()) { int tmp=q.front(); q.pop(); // cout<<tmp<<endl; if(tmp==stop)return ; for(int i=0;i<num;i++) { if(!vis[isprim[i]]&&pan(isprim[i],tmp)) { vis[isprim[i]]=true; q.push(isprim[i]); d[isprim[i]]=d[tmp]+1; } } }}int main(){ //freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); int n,i,j,k,t; num=0; prim[0]=prim[1]=1;//筛选素数 for(i=2;i<maxn;i++) if(!prim[i]) { if(i>1000)isprim[num++]=i; for(j=i+i;j<maxn;j+=i) prim[j]=1; } int T; scanf("%d",&T); while(T--) { int a,b; scanf("%d%d",&a,&b); d[b]=inf; bfs(a,b); if(d[b]!=inf) printf("%d\n",d[b]); else printf("Impossible\n"); } return 0;}
0 0
- F - Prime Path POJ 3126 筛选素数+bfs
- POJ 3126 Prime Path (素数筛选+bfs)
- POJ 3126 Prime Path (BFS) (F)
- POJ 3126 Prime Path【素数+bfs】
- POJ 3126 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最短路)
- 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+素数打表)
- 从标准输入流中读取数据,并存储到文件中
- 利用python输出json简单数据
- Excel Sheet Column Title (easy)
- 解析operators
- Java学习笔记——静态代码块,构造代码块,构造函数间的执行顺序
- F - Prime Path POJ 3126 筛选素数+bfs
- Linux硬盘分区方案
- LeetCode Number of 1 Bits
- html5标签概括
- LAMP环境搭建问题
- ios开发常见问题文章连接
- strrchr函数的实现
- 人脸识别 光照预处理
- C/C++从入门到高手所有必备PDF书籍收藏