Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Check Bit K

Check Bit K

Difficulty: 800 2000 ms 128 MB

bitwise

Is bit K (0-indexed from the least significant) set in N?

Input: one line with two integers N and K.

Output: YES or NO.

Constraints:

  • 0 ≤ N ≤ 1018
  • 0 ≤ K ≤ 62

Sample Tests

Input 1
10 1
Output 1
YES
Input 2
10 2
Output 2
NO

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen