Double or Add One — Solution & Editorial
Work backwards from B: halve when even (and still ≥ A), otherwise subtract 1 — the reverse moves are forced, which is why the greedy is optimal (forwards greedy is not).
Complexity: O(log B)
Watch out: Forward greedy (double when possible) fails; reasoning backwards from B makes each step forced.