Tap here to switch tabs
Problem
Submissions

Problem: Minimum Operations to Make the Integer Zero

Minimum Operations to Make the Integer Zero asks for the fewest moves that subtract a power of two plus an offset to reach zero, or minus one if impossible.

Statement

You are given two integers num1 and num2.

In a single operation, you may select any integer i within the range [0,60][0, 60] and subtract (2i+‘num2‘)(2^i + \text{`num2`}) from num1.

Determine the minimum number of operations required to reduce num1 to exactly 00.

If it is not possible to make num1 equal to 00, return −1-1.

Note: In each operation, you are free to choose a different value of i.

Constraints:

  • 1≤1 \leq num1 ≤109\leq 10^9

  • −109≤-10^9 \leq num2 ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Operations to Make the Integer Zero

Minimum Operations to Make the Integer Zero asks for the fewest moves that subtract a power of two plus an offset to reach zero, or minus one if impossible.

Statement

You are given two integers num1 and num2.

In a single operation, you may select any integer i within the range [0,60][0, 60] and subtract (2i+‘num2‘)(2^i + \text{`num2`}) from num1.

Determine the minimum number of operations required to reduce num1 to exactly 00.

If it is not possible to make num1 equal to 00, return −1-1.

Note: In each operation, you are free to choose a different value of i.

Constraints:

  • 1≤1 \leq num1 ≤109\leq 10^9

  • −109≤-10^9 \leq num2 ≤109\leq 10^9