Determine the optimally small number of pails to purchase, given the guarantee that at least one solution is possible for all contest input data.

• 计算需要购买的最佳桶集，保证所有的测试数据都至少有一个解。