Parliament
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 16521 | Accepted: 6975 |
Description
New convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into disjoint groups of different sizes and every day each group has to send one delegate to the conciliatory committee. The
composition of the conciliatory committee should be different each day. The Parliament works only while this can be accomplished.
You are to write a program that will determine how many delegates should contain each group in order for Parliament to work as long as possible.
You are to write a program that will determine how many delegates should contain each group in order for Parliament to work as long as possible.
Input
The input file contains a single integer N (5<=N<=1000 ).
Output
Write to the output file the sizes of groups that allow the Parliament to work for the maximal possible time. These sizes should be printed on a single line in ascending order and should be separated by spaces.
Sample Input
7
Sample Output
3 4
题目大意：
愚人岛召开议会，议会由N代表，根据条例的规定，每名代表应划分为不相同的几组，每一天的每一个组都要派一个代表到和解委员会，和解委员会的组成应该是不同的每一天，国会只能在这可以完成你要写一个程序，求出如何分组才能使得议会召开的时间最长。
就是将一个数拆分为若干个数字，使得乘积最大
版权声明：本文为博主原创文章，未经博主允许不得转载。