Technocup 2017 - Elimination Round 1: Transformation: from A to B

最新推荐文章于 2020-12-17 20:59:57 发布

hu275408194

最新推荐文章于 2020-12-17 20:59:57 发布

阅读量208

点赞数

分类专栏： codeforces 文章标签： codeforces

本文链接：https://blog.csdn.net/hu275408194/article/details/52938285

版权

codeforces 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

让自己处于好心情，世界因此而变

原题链接

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.
Input

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.
Output

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.

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.

题意理解

一开始队友说可以暴力递归，我多想了会，看见两种数字增大的方法只有两个结果，一个是奇数，一个是偶数，那么倒着想就ok了。

以下AC代码

/*
 * from A to B.cpp
 *
 *  Created on: Oct 26, 2016
 *      Author: chan
 */
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    int a,b;
    int data[100],cnt;
    while(cin>>a>>b){
        if(a==b){
            cout<<"NO\n";
        }
        else{
            cnt=0;
            data[cnt++]=b;
            while(b>a){
                if(b%2==0) b/=2;
                else b=(b-1)/10;
                data[cnt++]=b;
            }
            if(b==a&&(data[cnt-1]*2==data[cnt-2]||
            data[cnt-1]*10+1==data[cnt-2])){

                cout<<"YES\n";
                cout<<cnt<<endl;
                for(int i=cnt-1;i>=0;i--)
                    cout<<data[i]<<" ";
                cout<<endl;
            }
            else
                cout<<"NO\n";

        }

    }
}