设n是一个正整数。现在要求将n分解为若干个互不相同的自然数的和，且使这些自然 数的乘积最大。 对于给定的正整数n，编程计算最优分解方案。-Let n be a positive integer. Now requires that the n-divided into a number of mutually different natural numbers, and that the product of the number of these natural maximum. For a