Codeforces Round #295 B. Two Buttons

B. Two Buttons

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue button, device subtracts one from the number on the display. If at some point the number stops being positive, the device breaks down. The display can show arbitrarily large numbers. Initially, the display shows number n.

Bob wants to get number m on the display. What minimum number of clicks he has to make in order to achieve this result?

Input

The first and the only line of the input contains two distinct integers n and m (1 ≤ n, m ≤ 104), separated by a space .

Output

Print a single number — the minimum number of times one needs to push the button required to get the number m out of number n.

Sample test(s)

input

4 6

output

2

input

10 1

output

9

Note

In the first example you need to push the blue button once, and then push the red button once.

In the second example, doubling the number is unnecessary, so we need to push the blue button nine times.

这题依旧是不难，简单暴力的广搜一遍就完事了~~ 不过作为一个为了参加蓝桥杯和准备项目才不得不练习java的小白来说，写起来还是有点拙计的。。。特别队列那一块，java与C++的写法相比略有不同，还是纠结了好一会~~

package com.codeforces.algorithm;

import java.io.*;
import java.util.*;

public class TwoButtons {
	public static void main(String []args){
		@SuppressWarnings("resource")
		Scanner cin = new Scanner(System.in);
		PrintWriter cout = new PrintWriter(System.out);
		while(cin.hasNext()){
			int n = cin.nextInt(),m=cin.nextInt();
			boolean []vis = new boolean[10005];
			Node a=new Node(n,0);
			Queue<Node> q = new LinkedList<Node>();
			q.offer(a);
			while(!q.isEmpty()){
				a = q.poll();
				if(vis[a.start]) continue;
				if(a.start==m){
				//	System.out.println("sss");
					cout.println(a.time);
					cout.flush();
					break;
				}
				vis[a.start]=true;
				a.time++;
				Node tmpA= new Node(a),tmpB=new Node(a);
				tmpA.start--;tmpB.start*=2;
				if(tmpA.start>0&&!vis[tmpA.start]){
					q.offer(tmpA);
				}
				if(tmpB.start<=10000&&!vis[tmpB.start]){
					q.offer(tmpB);
				}
			}
		}
		cout.close();
	}
}
class Node{
	public int start;
	public int time;
	public Node(int s,int t){
		start = s;time = t; 
	}
	public Node(Node a){
		start=a.start;
		time=a.time;
	}
};