OpenJudge - 12:Maximum Product of Sequence
12:Maximum Product of Sequence
总时间限制:
1000ms
内存限制:
65536kB
描述
Find a sequence of M positive numbers with the maximum product, while the sum of them is N.
寻找M个和为N的正整数,使他们的乘积最大。
输入
Two positive integers M (M <= 10) and N (N <= 100).
两个正整数M(M<=10)和N(N<=100)。
输出
One line contains M integers.
一行,包含M个正整数。
样例输入
3 8
样例输出
2 3 3