poj---3126
2016-07-23 15:32
309 查看
<div auto;"="" style="line-height: 1.5; outline: none;">
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
Sample Output
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include <queue>
using namespace std;
#define MAXV 10000
bool prime[MAXV];
void init()
{ //对素数打表
int i,j;
for(i=1000;i<=10000;i++)
{
for(j=2;j<i;j++)
if(i%j==0)
{
prime[i]=0;//不是素数
break;
}
if(j==i)
prime[i]=1;//是素数
}
}
int bfs(int first,int last)
{
bool dis[MAXV];
queue <int>q;
int v,i,j,temp,vtemp,count[MAXV],t[4];
memset(dis,false,sizeof(dis));
memset(count,0,sizeof(count));
q.push(first);
dis[first]=1;
while(q.empty()==0)
{
v=q.front();//v就是开头那个数
q.pop();//然后清空这一个数
t[0]=v/1000;//分离千位
t[1]=v%1000/100;//分离百位
t[2]=v%100/10;//分离十位
t[3]=v%10;//分离个位
for(j=0;j<4;j++)
{
temp=t[j];
for(i=0;i<10;i++)
if(i!=temp)
{
t[j]=i;
vtemp=t[0]*1000+t[1]*100+t[2]*10+t[3];
if(dis[vtemp]==0 && prime[vtemp]==1)
8b07
{
count[vtemp]=count[v]+1;
dis[vtemp]=1;//代表这个数已经用过
q.push(vtemp);//然后删除这个数
}
if(vtemp==last)
return count[vtemp];
}
t[j]=temp;
}
if(v==last)
return count[v];
}
return 0;
}
int main()
{
int n,a,b,key;
init();
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&a,&b);
key=bfs(a,b);
if(key!=0)
printf("%d\n",key);
else
printf("Impossible\n");
}
return 0;
}
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<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include <queue>
using namespace std;
#define MAXV 10000
bool prime[MAXV];
void init()
{ //对素数打表
int i,j;
for(i=1000;i<=10000;i++)
{
for(j=2;j<i;j++)
if(i%j==0)
{
prime[i]=0;//不是素数
break;
}
if(j==i)
prime[i]=1;//是素数
}
}
int bfs(int first,int last)
{
bool dis[MAXV];
queue <int>q;
int v,i,j,temp,vtemp,count[MAXV],t[4];
memset(dis,false,sizeof(dis));
memset(count,0,sizeof(count));
q.push(first);
dis[first]=1;
while(q.empty()==0)
{
v=q.front();//v就是开头那个数
q.pop();//然后清空这一个数
t[0]=v/1000;//分离千位
t[1]=v%1000/100;//分离百位
t[2]=v%100/10;//分离十位
t[3]=v%10;//分离个位
for(j=0;j<4;j++)
{
temp=t[j];
for(i=0;i<10;i++)
if(i!=temp)
{
t[j]=i;
vtemp=t[0]*1000+t[1]*100+t[2]*10+t[3];
if(dis[vtemp]==0 && prime[vtemp]==1)
8b07
{
count[vtemp]=count[v]+1;
dis[vtemp]=1;//代表这个数已经用过
q.push(vtemp);//然后删除这个数
}
if(vtemp==last)
return count[vtemp];
}
t[j]=temp;
}
if(v==last)
return count[v];
}
return 0;
}
int main()
{
int n,a,b,key;
init();
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&a,&b);
key=bfs(a,b);
if(key!=0)
printf("%d\n",key);
else
printf("Impossible\n");
}
return 0;
}
相关文章推荐
- 14 指针热身
- UVA 196 Spreadsheet
- hibernate.properties
- EJB——消息和消息驱动bean(二)
- tjut 4899
- POJ 2406 Power Strings 数据结构+KMP
- [线性DP]奶牛的锻炼
- PMP学习笔记(1)工作分解结构-资源分解结构-职责分配矩阵-资源日历
- nginx缓冲区优化
- 一、windows 下安装并使用 lua
- poj----2253
- 各大Oj平台介绍
- PHP的spl_autoload_register用法
- Dalvik VM和JVM的比较
- iOS开发之消息推送 —— 远程消息推送入门
- CentOS虚拟机NAT方式无法上网解决方法
- poj----3259
- Input Events(输入事件)
- poj---3660
- 多个TextView 跑马灯效果