A12984 | Magic Stick
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Recently Petya walked in the forest and found a magic stick.
Since Petya really likes numbers, the first thing he learned was spells for changing numbers. So far, he knows only two spells that can be applied to a positive integer:
1. If the chosen number $a$ is even, then the spell will turn it into $\frac{3a}{2}$ ;
2. If the chosen number $a$ is greater than one, then the spell will turn it into $a-1$ .
Note that if the number is even and greater than one, then Petya can choose which spell to apply.
Petya now has only one number $x$ . He wants to know if his favorite number $y$ can be obtained from $x$ using the spells he knows. The spells can be used any number of times in any order. It is not required to use spells, Petya can leave $x$ as it is.
Since Petya really likes numbers, the first thing he learned was spells for changing numbers. So far, he knows only two spells that can be applied to a positive integer:
1. If the chosen number $a$ is even, then the spell will turn it into $\frac{3a}{2}$ ;
2. If the chosen number $a$ is greater than one, then the spell will turn it into $a-1$ .
Note that if the number is even and greater than one, then Petya can choose which spell to apply.
Petya now has only one number $x$ . He wants to know if his favorite number $y$ can be obtained from $x$ using the spells he knows. The spells can be used any number of times in any order. It is not required to use spells, Petya can leave $x$ as it is.
输入格式
The first line contains single integer $T$ ( $1 \le T \le 10^4$ ) — the number of test cases. Each test case consists of two lines.
The first line of each test case contains two integers $x$ and $y$ ( $1 \le x, y \le 10^9$ ) — the current number and the number that Petya wants to get.
The first line of each test case contains two integers $x$ and $y$ ( $1 \le x, y \le 10^9$ ) — the current number and the number that Petya wants to get.
输出格式
For the $i$ -th test case print the answer on it — YES if Petya can get the number $y$ from the number $x$ using known spells, and NO otherwise.
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
输入输出样例
输入 #1
7 2 3 1 1 3 6 6 8 1 2 4 1 31235 6578234
输出 #1
YES YES NO YES NO YES YES
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted