我需要编写函数作为赋值的一部分..\n我需要计算将 n 划分为正整数之和的方法数，但我不能使用 while 或 goto
\n\n/*\n * REQUIRES: n > 0\n * EFFECTS: computes the number of ways to partition n into the sum of\n * positive integers\n * MUST be tree recursive\n * Hint: Use a helper function that computes the number of ways to\n * partition n using a bounded subset of integers. Then use logic\n * similar to count_change() from lecture to divide partitions into\n * those that use a specific item and those that …