Codeforces #295 (Div. 2) B. Two Buttons（逆向思维）（搜索）

Two Buttons:

题目大意：（文末有原题）

给出两个整数n和m，判断需要多少步能使n变为m；

能进行操作：1. n *= 2； 2. n -= 1;

思路一：

逆向思维，从m向n推，最短的距离就是更多的/2；如果是奇数就先+1变成偶数；如果是偶数就/2；最后再如果m<n;加上n-m步（从m加1一直加到n）；

代码：

#include <iostream>
using namespace std;

int main() {
	int n, m, s = 0;
	cin >> n >> m;
	
	while(m > n) {
		if(m % 2) {
			m++;
			s++;
		}else {
			m /= 2;
			s++;
		}
	}
	
	s += n - m;
	cout << s << endl;
	return 0;
}

---

思路二：

使用bfs或者dfs；

可以参考该题（已附上链接）；

bfs代码：

#include <iostream>
#include <queue>
#include <cstring>
using namespace std;

int n, m;
const int maxn = 2e5 + 10;
int vis[maxn];	//标记数组； 

struct Node{
	int x;
	int step;
	Node(int x = 0, int step = 0) : x(x), step(step) {}
};

void bfs() {
	queue<Node> q;
	q.push(Node(n, 0));
	vis[n]++;
	
	while(!q.empty()) {
		Node now, temp;
		now = q.front();
		q.pop();
		if(now.x == m) {
			cout << now.step << endl;
			return;
		}
		if(!vis[now.x * 2] && now.x * 2 >= 0 && now.x <= 2 * m) {
			vis[now.x * 2]++;
			q.push(Node(now.x * 2, now.step + 1));
		}
		if(!vis[now.x - 1] && now.x - 1 > 0) {	//注意 now.x-1应该是>0而不是>=0，因为当=0时候，之后-1<0,*2=0,会RE； 
			vis[now.x - 1]++;
			q.push(Node(now.x - 1, now.step + 1));
		}
	}
}

int main() {
	cin >> n >> m;
	memset(vis, 0, sizeof(vis));
	bfs();
	return 0;
}

---

原题：

题目：

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?

输入：

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

输出：

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.

样例：

Input：

4 6

Output：

2

Input：

10 1

Output：

9