1286. Divide a Number by 2 Using Right Shift

Given a non-negative integer n and a non-negative exponent k, compute the floor of n divided by 2^k using a right shift instead of division. The classic 'divide by 2' is the special case k = 1.

Input: A JSON object {"n": <non-negative integer>, "k": <exponent>} with 0 <= k <= 20.

Output: Return floor(n / 2^k) as an integer.

Examples

Input: {"n":20,"k":1}
Output: 10
Explanation: 20 >> 1 = 10 = 20 / 2.

Input: {"n":100,"k":3}
Output: 12
Explanation: 100 >> 3 = 12 = floor(100 / 8).

Constraints

• 0 <= n <= 10^12
• 0 <= k <= 20

Asked by