CodeForces 520B Two Buttons

最新推荐文章于 2025-01-20 01:27:46 发布

原创最新推荐文章于 2025-01-20 01:27:46 发布 · 308 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#bfs

搜索专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一种使用广度优先搜索算法（BFS）解决如何从初始正整数n通过最少的操作步骤达到目标数m的方法。操作包括点击红色按钮使数字翻倍或蓝色按钮使数字减一。文中提供了一个C++实现示例。

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 ≤ 10⁴), 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.

Example

Input

4 6

Output

Input

10 1

Output

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.

bfs就过了

#include <stdio.h>
#include <string.h>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
int n , m;
struct node{
	int x;
	int step;
}pre, nex;
int v[10005];
void bfs() {
	queue<node> q;
	pre.x = n;
	pre.step = 0;
	v[n] = 1;
	q.push(pre);
	while(!q.empty()) {
		nex = q.front();
		q.pop();
		if(nex.x == m) {
			printf("%d\n",nex.step);
			return ;
		}
		int dx;
		for(int i = 0; i < 2; i++) {
			if(i == 0) {
				if(nex.x > m) {
					dx = nex.x - 1;
					if(v[dx] == 0 && dx >= 1) {
						v[dx] = 1;
						pre.x = dx;
						pre.step = nex.step + 1;
						q.push(pre);
					}
				}
				else {
					dx = nex.x*2;
					if(v[dx] == 0 && dx >= 1) {
						v[dx] = 1;
						pre.x = dx;
						pre.step = nex.step + 1;
						q.push(pre);
					}
					dx = nex.x-1;
					if(v[dx] == 0 && dx >= 1) {
						v[dx] = 1;
						pre.x = dx;
						pre.step = nex.step + 1;
						q.push(pre);
					}
				}
			}
		}
	}
}
int main() {
	memset(v, 0, sizeof(v));
	scanf("%d%d",&n,&m);
	bfs();
	return 0;
}