关闭

poj 3126 Prime Path(简单题)

标签: POJBFS
388人阅读 评论(0) 收藏 举报
分类:
Prime Path
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 13425   Accepted: 7580

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

题意:
给定两个四位数a,b,皆为素数,求由a修改至b的最少需要的次数。要求每次只能修改一位,且修改后的数必须是素数。

思路:
由于数是四位数,每次修改一位,一共有9*9*9*9种情况,BFS,对于每种情况,如果修改后的数满足条件即入队。

代码:
1.最笨的方法:
//Memory Time
//308K  125MS
#include<iostream>
#include<queue>
#include<cstring>
#include<cmath>
using namespace std;

int vis[10000],dis[10000];//vis[]记录该数是否修改过,dis[]记录修改的步数

int judge(int num)//判断是否为素数
{
    int flag=1;
    for(int i=2;i*i<=num;i++){
        if(num%i==0){
            flag=0;break;
        }
    }
    return flag;
}

int main()
{
    int n,num1,num2;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int l;
        memset(vis,0,sizeof(vis));
        memset(dis,9999,sizeof(dis));
        cin>>num1>>num2;
        if(num1==num2)
        {
            cout<<0<<endl;
            continue;
        }
        queue<int> q;
        q.push(num1);
        dis[num1]=0;
        while(!q.empty())
        {
            l=q.front();
            q.pop();
            if(l==num2)
                break;
            for(int j=0;j<4;j++)
            {
                for(int k=0;k<=9;k++)
                {
                    int shu[4];
                    shu[0]=l%10;
                    shu[1]=(l%100-shu[0])/10;
                    shu[2]=(l%1000-shu[1]*10-shu[0])/100;
                    shu[3]=(l%10000-shu[2]*100-shu[1]*10-shu[0])/1000;
                    if(shu[j]==k)continue;
                    shu[j]=k;
                    int num3=shu[3]*1000+shu[2]*100+shu[1]*10+shu[0];//修改数

                    if(judge(num3)&& num3>999 && !vis[num3])//满足条件,入队
                    {
                        q.push(num3);
                        vis[num3]++;
                        dis[num3] = dis[l]+1;
                    }
                }
            }
        }
        if(dis[num2]>=9999)
            cout<<"Impossible"<<endl;
        else
            cout<<dis[num2]<<endl;
    }
    return 0;
}

2.剪枝优化
//Memory Time 
//212K   16MS 

#include<iostream>
using namespace std;

typedef class
{
	public:
		int prime;
		int step;
}number;

bool JudgePrime(int digit)
{
	if(digit==2 || digit==3)
		return true;
	else if(digit<=1 || digit%2==0)
		return false;
	else if(digit>3)
	{
		for(int i=3;i*i<=digit;i+=2)
			if(digit%i==0)
				return false;
		return true;
	}
}

int a,b;
bool vist[15000];
number queue[15000];

void BFS(void)
{
	int i;  //temporary
	int head,tail;
	queue[head=tail=0].prime=a;
	queue[tail++].step=0;
	vist[a]=true;

	while(head<tail)
	{
		number x=queue[head++];
		if(x.prime==b)
		{
			cout<<x.step<<endl;
			return;
		}

		int unit=x.prime%10;       //获取x的个位
		int deca=(x.prime/10)%10;  //获取x的十位

		for(i=1;i<=9;i+=2)     //枚举x的个位,保证四位数为奇数(偶数必不是素数)
		{
			int y=(x.prime/10)*10+i;
			if(y!=x.prime && !vist[y] && JudgePrime(y))
			{
				vist[y]=true;
				queue[tail].prime=y;
				queue[tail++].step=x.step+1;
			}
		}
		for(i=0;i<=9;i++)     //枚举x的十位
		{
			int y=(x.prime/100)*100+i*10+unit;
			if(y!=x.prime && !vist[y] && JudgePrime(y))
			{
				vist[y]=true;
				queue[tail].prime=y;
				queue[tail++].step=x.step+1;
			}
		}
		for(i=0;i<=9;i++)     //枚举x的百位
		{
			int y=(x.prime/1000)*1000+i*100+deca*10+unit;
			if(y!=x.prime && !vist[y] && JudgePrime(y))
			{
				vist[y]=true;
				queue[tail].prime=y;
				queue[tail++].step=x.step+1;
			}
		}
		for(i=1;i<=9;i++)     //枚举x的千位,保证四位数,千位最少为1
		{
			int y=x.prime%1000+i*1000;
			if(y!=x.prime && !vist[y] && JudgePrime(y))
			{
				vist[y]=true;
				queue[tail].prime=y;
				queue[tail++].step=x.step+1;
			}
		}

	}

	cout<<"Impossible"<<endl;
	return;
}

int main(void)
{
	int test;
	cin>>test;
	while(test--)
	{
		cin>>a>>b;
		memset(vist,false,sizeof(vist));
		BFS();
	}
	return 0;
}


1
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

Prime Path(POJ 3126)解题报告

Prime Path(POJ 3126)解题报告 一、原题 Prime Path Time Limit:1000MS     Memory Limit:65536KB &#...
  • Chrome_matrix_68
  • Chrome_matrix_68
  • 2014-07-29 18:59
  • 500

POJ 3126 Prime Path(素数变换路径)

在进队之前就判断有没有被访问过
  • nameofcsdn
  • nameofcsdn
  • 2016-07-25 23:39
  • 1660

POJ 3126 Prime Path(素数,BFS最短路)

【链接】http://poj.org/problem?id=3126 【题意】给个字符串,求满足形如“E...E...E”这种鬼样子的E串最大长度,其中“...”可以是任意个数的任意字符(没有也ok),但是三个E之间不能重叠 【思路】① 掏出素数筛的模板,找到1W以内素数    ...
  • guluugulu
  • guluugulu
  • 2014-03-22 19:48
  • 842

poj 几道简单的搜索题 (一)

题目:poj 2488 A Knight's Journey 题意: 给一个m*n的棋盘,马走日,给出一条字典序最小的马的路线来走完整个棋盘? 分析: 如果能走完棋盘,那么从(1,1)点dfs即可,因为他能走完整个棋盘嘛,总有一步会经过(1,1),所以从(1,1)出发就能到其他所...
  • hjt_fathomless
  • hjt_fathomless
  • 2016-07-13 16:24
  • 584

poj 3126 Prime Path([kuangbin带你飞]专题一 简单搜索)

题目连接:题目 题目大意:两个素数,每次可以改变前一个数的某一位,并且改变完还是素数,求从第一个数变成第二个数的最小步数 解题思路:能读懂题目就差不多能知道用bfs,枚举每一位,改变数,看是不是素数, #include #include #include #include #include #...
  • HAHAAC
  • HAHAAC
  • 2016-10-16 15:47
  • 134

poj 几道简单的搜索题(三)

题目:poj 2531 题意: 给出n(n 分析: n=20,暴力枚举的时间复杂度才O(2^20*C),C是求和的时间常数。2000ms的时间足够了。暴力枚举的话可以子集枚举和递归(时间接近1000ms)。 这题递归的话可以剪枝,可以优化到32ms,方法是参考:http://blog.csdn.n...
  • hjt_fathomless
  • hjt_fathomless
  • 2016-07-15 00:12
  • 311

Prime Path - POJ 3126 BFS宽度(广度)优先搜索

Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10483   Accepted: 5992 ...
  • u014733623
  • u014733623
  • 2014-04-15 18:51
  • 626

POJ 3126 Prime Path(首相的无厘头要求,这个是不是华盛顿,BFS)

Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 17143   Accepted: 9637 Description T...
  • shyazhut
  • shyazhut
  • 2016-07-29 20:03
  • 180

POJ3518_Prime Gap【素数】【水题】

POJ3518_Prime Gap【素数】【水题】
  • u011676797
  • u011676797
  • 2014-09-19 06:21
  • 1385

POJ题目分类推荐 (很好很有层次感)

OJ上的一些水题(可用来练手和增加自信)  (poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094) 初期: 一.基本算法:       ...
  • verticallimit
  • verticallimit
  • 2013-09-15 21:00
  • 17833
    个人资料
    • 访问:37800次
    • 积分:1016
    • 等级:
    • 排名:千里之外
    • 原创:64篇
    • 转载:9篇
    • 译文:0篇
    • 评论:5条
    最新评论