OpenJudge

1032:Parliament

总时间限制:
1000ms
内存限制:
65536kB
描述
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
来源
Northeastern Europe 1998
全局题号
34
添加于
2009-10-29
提交次数
275
尝试人数
134
通过人数
98
您的评价 很水 简单 一般 较难 变态
  • 标签(多个标签用空格分隔):
  • 常用标签:
    递归   动态规划   贪心   搜索   枚举   模拟   数学   字符串处理   几何   高精度计算   图论  

共有1人评分

0.0%
0.0%
100.0%
0.0%
0.0%

已有的标签

数学(1)