Maximum Product of Sequence
https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH12
1000ms 65536K
描述:
Find a sequence of M positive numbers with the maximum product, while the sum of them is N.
当他们的和是n时,找到一个含有m个正整数的有最大乘积的序列
输入:
Two positive integers M (M <= 10) and N (N <= 100).
两个正整数表示m和n
输出:
One line contains M integers.
一行包括m个整数
样例输入:
3 8
样例输出:
2 3 3