POJ - 1032 Parliament

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.

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

一个数分成两个不小于2的数积一定比原数大
一个数分成的两个数越平均越大
因为不可重复所以最优的应该是一个序列2-3-4…
最后可能会有剩下的数
剩下的就从后往前加在每一个数上
从前往后会有重复

代码

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
const int max_=1000005;
char al[max_];
int main()
{
    int n,m[100];
    while(~scanf("%d",&n))
    {
        int l=0;
        while(n>=l+2)
        {
            m[l]=l+2;
            n-=(l+2);
            ++l;
        }
        int t=l-1;
        while(n)
        {
            m[t--]++;
            --n;
            if(t<0)
                t=l-1;
        }
        for(int i=0;i<l;++i)
        {
            if(i)
                putchar(' ');
            printf("%d",m[i]);
        }
        putchar('\n');
    }
}