Best Compression Ever |
Being educated in Computer Science and Mathematics is not always easy. Especially not if you have ``friends'' who repeatedly insist on showing you their new ``proofs'' that P equals NP, that the Riemann Hypothesis is true, and so on.
One of your friends recently claims to have found a fantastic new
compression algorithm. As an example of its amazing performance,
your friend has told you that every file in your precious collection
of random bit strings after compression would be at most b
Your collection of random bit strings consists of N
The input consists of two integers N
For each test case, write to the output a line containing either ``yes'' if it is possible to
compress all the N
Input
The input file contains several test cases, each of them as described below.
Output
Sample Input
13 3
1 0
31415926535897 40
Sample Output
yes
yes
no