codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1257B.md (1654B)


      1 Source: https://codeforces.com/problemset/problem/1257/B
      2 
      3 B. Magic Stick
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Recently Petya walked in the forest and found a magic stick.
     22 
     23 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:
     24 
     25 1. If the chosen number $a$ is even, then the spell will turn it into $\frac{3a}{2}$;
     26 2. If the chosen number $a$ is greater than one, then the spell will turn it into $a-1$.
     27 
     28 Note that if the number is even and greater than one, then Petya can choose which spell to apply.
     29 
     30 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.
     31 
     32 Input
     33 
     34 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.
     35 
     36 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.
     37 
     38 Output
     39 
     40 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.
     41 
     42 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).
     43 
     44 Example
     45 
     46 Input
     47 
     48 ```
     49 7
     50 2 3
     51 1 1
     52 3 6
     53 6 8
     54 1 2
     55 4 1
     56 31235 6578234
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 YES
     63 YES
     64 NO
     65 YES
     66 NO
     67 YES
     68 YES
     69 ```