If $$$m=4$$$ and $$$d=1$$$ output "YES". Otherwise, output "NO".

Output top $$$8$$$ in TheForce rating.

let's give look at $$$A$$$ and $$$B$$$ starting from max of most signinficant bit between $$$A$$$ and $$$B$$$.

$$$A = 18, B = 13$$$

So, at the $$$i-th$$$ bit of $$$A$$$ and $$$B$$$, $$$A_i \oplus B_i$$$ must equal to $$$1$$$ where $$$(0 \leq i \leq \max(msb(A), msb(B)))$$$

So, $$$A \oplus B = 11111$$$

So, if $$$A \oplus B=2^{\max(msb(A), msb(B)) + 1}-1$$$ output "YES". Otherwise, output "NO".

def msb(n):
    return n.bit_length() - 1

t = int(input())

for _ in range(t):
    a, b = list(map(int, input().split()))
    _msb = max(msb(a), msb(b))
    if( (a ^ b) == 2**(_msb + 1) - 1 and a != b):
        print("YES")
    else:
        print("NO")

Output the memory limit of the $$$i$$$-th problem.

Print the number of a blog with at least 1000 downvote (there are currently 8 blogs in total). the value of n actually represents the order of date, not the order from most downvoted blogs.

Google "apple codeforce" to get the link: https://mirror.codeforces.com/problemset/problem/1843/D