同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22635_Parliamen

2022-5-16 18:22| 发布者: Hocassian| 查看: 22| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506805468900-Problem List-采集的数据-后羿采集器.html

Pro.ID

22635

Title

Parliament

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22635

AC

Submit

Ratio

时间&空间限制

Time Limit: 900/300 MS (Java/Others) Memory Limit: 20000/10000 K (Java/Others)

描述

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 ).

输出

Description

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

Sample Output

3 4

Source

NEERC 1998