A10612 | Transformation: from A to B
时间限制1s
内存限制256MB
通过 / 提交0/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$ .
- 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<=10^{9}$ ) — 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 $x_{1},x_{2},...,x_{k}$ , where:
- $x_{1}$ should be equal to $a$ ,
- $x_{k}$ should be equal to $b$ ,
- $x_{i}$ should be obtained from $x_{i-1}$ using any of two described operations ( $1<i<=k$ ).
If there are multiple answers, print any of them.
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 $x_{1},x_{2},...,x_{k}$ , where:
- $x_{1}$ should be equal to $a$ ,
- $x_{k}$ should be equal to $b$ ,
- $x_{i}$ should be obtained from $x_{i-1}$ using any of two described operations ( $1<i<=k$ ).
If there are multiple answers, print any of them.
输入输出样例
输入 #1
2 162
输出 #1
YES 5 2 4 8 81 162
输入 #2
4 42
输出 #2
NO
输入 #3
100 40021
输出 #3
YES 5 100 200 2001 4002 40021
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted