Emptying Sets: The Cookie Monster Problem

Megan Belzner

Given a set of integers $S=\{k_1,k_2,...,k_n\}$, the Cookie Monster Problem is the problem of making all elements of the set equal 0 in the minimum number of moves. Consider…