poj 3278 Catch That Cow bfs

Description

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

* Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
* Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input

Line 1: Two space-separated integers: N and K

Output

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

Sample Input

5 17

Sample Output

4

//简单bfs

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cstring>

using namespace std;
int visit[];
int n,k;

struct node
{
    int x,step;
};

void bfs()
{
    node st,ed;
    queue <node> q;
    st.x=n;
    st.step=;
    memset(visit,,sizeof(visit));
    visit[n]=;
    q.push(st);
    while(!q.empty())
    {
        st=q.front();
        q.pop();
        if(st.x==k)
        {
            cout<<st.step<<endl;
            return ;
        }
        if(st.x+<=&&visit[st.x+]==)
        {
            visit[st.x+]=;
            ed.x=st.x+;
            ed.step=st.step+;
            q.push(ed);
        }
        if(st.x->=&&visit[st.x-]==)
        {
            visit[st.x-]=;
            ed.step=st.step+;
            ed.x=st.x-;
            q.push(ed);
        }
        if(*st.x<=&&visit[*st.x]==)
        {
            visit[*st.x]=;
            ed.step=st.step+;
            ed.x=st.x*;
            q.push(ed);
        }
    }
}

int main()
{
    while(cin>>n>>k)
    {
        bfs();
    }
    return ;
}