Preparing NOJ

Maximum Product of Sequence

1000ms 65536K

Description:

Find a sequence of M positive numbers with the maximum product, while the sum of them is N.

Input:

Two positive integers M (M <= 10) and N (N <= 100).

Output:

One line contains M integers.

Sample Input:

3 8

Sample Output:

2 3 3

Info

NOIOPEN

Provider NOIOPEN

Origin 简单英文题

Code NOIOPJENGLISH12

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 08/15/2021 18:56:21

Related

Nothing Yet