Official algorithmic problem description and constraints.
Alice and Bob are playing a game of basketball against each other, one-versus-one.
Currently, Alice has A points, and Bob has B points.
Each shot of a player can score either 2 or 3 points.
Alice isn't just out to win - she wants to win in dominant fashion.
Alice believes that her win is dominant if she ends the game with at least 10 points more than Bob.
If Alice is able to prevent Bob from scoring any more points, what's the minimum number of shots she further needs to get a dominant victory?
Detailed video explanations, mathematical intuition, and clean C++ implementation code.
