1032:Parliament

题目描述
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.
输入解释
The input file contains a single integer N (5<=N<=1000 ).
输出解释
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.
输入样例
7
输出样例
3 4

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-1032

最后修改于 2020-10-29 05:50:27 UTC 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 10000

·

·

·

·

登陆或注册以提交代码