書、寫未來的专栏

ProblemSean and Patrick are brothers who just got a nice bag of candy from their parents. Each piece of candy has some positive integer value, and the children want to divide the candy between them. First, Sean will split the candy into two piles, and choo

题目： 公司发了某商务券1000元，限定只能购买商店中的m种商品。每种商品的价格为m1，m2……，要求程序列出所有正好能消费完该购物券的不同方法：程序输入:第一行是一个整数m，代表可购买商品的种类数。接下来是m个整数，每个一行，分别代表了m件商品的单价。程序输出：第一行是一个整数，表示共有多少种方案，第二行开始，每种方案占一行，表示对每种商品购买的数量，中间用空格隔开。例如：输入： 2200300则应输出：25 03 2输入：2500 800则应输出：12 0输入的第一行为物品个数，之后的每行分别为物品的重

ProblemBlue and Orange are friendly robots. An evil computer mastermind has locked them up in separate hallways to test them, and then possibly give them cake. Each hallway contains 100 buttons labeled with the positive integers {1, 2, ..., 100}. Button k