Transformation: from A to B 递归

Transformation: from A to B 递归

Time limit：1000 ms Memory limit：262144 kB Source: Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) Tags: brute force dfs and similar *1100 Editorial: Announcement #1 (en) Announcement #2 (ru) Tutorial (en)

描述

Vasily has a number a, which he wants to turn into a number b. For this purpose, he can do two types of operations:

multiply the current number by 2 (that is, replace the number x by 2·x);
append the digit 1 to the right of current number (that is, replace the number x by 10·x + 1).
You need to help Vasily to transform the number a into the number b using only the operations described above, or find that it is impossible.

Note that in this task you are not required to minimize the number of operations. It suffices to find any way to transform a into b.

输入

The first line contains two positive integers a and b (1 ≤ a < b ≤ 109) — the number which Vasily has and the number he wants to have.

输出

If there is no way to get b from a, print “NO” (without quotes).

Otherwise print three lines. On the first line print “YES” (without quotes). The second line should contain single integer k — the length of the transformation sequence. On the third line print the sequence of transformations x1, x2, …, xk, where:

x1 should be equal to a,
xk should be equal to b,
xi should be obtained from xi - 1 using any of two described operations (1 < i ≤ k).
If there are multiple answers, print any of them.

Input

2 162

Output

YES
5
2 4 8 81 162

Input

4 42

Output

NO

Input

100 40021

Output

YES
5
100 200 2001 4002 40021

代码

#include <bits/stdc++.h>

#define PI 3.14159265358979383246
#define LL long long
#define INF 0x3f3f3f3f  

#define _for(i, a) for(int i = 0; i < (a); ++i)
#define _rep(i, a, b) for(int i = (a); i < (b); ++i)
#define _forit(a, b) for(a::iterator it = b.begin(); it != b.end(); it++)

using namespace std;

LL book[100000];
int t = 0;

bool che(LL a, LL b) {
	if (b < a) {
		return false;
	}
	book[t++] = b;
	if (a == b) {
		cout << "YES" << endl << t << endl;
		for (int i = t - 1; i >= 0; i--) {
			cout << book[i] << ' ';
		}
		t--;
		return true;
	}
	bool x = false;
	if (b % 10 == 1) {
		x = che(a, b / 10);
		t--;
		return x;
	}
	if (b % 2 == 0) {
		x = che(a, b / 2);
		t--;
		return x;
	}
	t--;
	return false;
}

int main()
{
	LL a, b;
	cin >> a >> b;
	if (!che(a, b)) {
		cout << "NO";
	}
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~