Poj 1032 Parliament

最新推荐文章于 2019-02-18 16:12:00 发布

weixin_30879833

最新推荐文章于 2019-02-18 16:12:00 发布

阅读量85

点赞数

原文链接：http://www.cnblogs.com/WQHui/p/7598469.html

版权

Parliament

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 19103		Accepted: 8101

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

Sample Output

3 4

Source

Northeastern Europe 1998

看国家集训队2003论文集邵烜程：《数学思想助你一臂之力》其中有详解；

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;

int n,tot,f[10008],ans,sum;

int main(){
    while(scanf("%d",&n)==1){
        tot=0;
        memset(f,0,sizeof(f));
        sum=n;
        for(int i=2;i<=n&&i<=sum;i++){
            tot++;
            f[tot]=i;
            sum=sum-i;
        }
        if(sum==tot+1) f[tot]++;
        for(int i=tot;i>=tot-sum+1;i--)
            f[i]++;
        for(int i=1;i<tot;i++)
            printf("%d ",f[i]);
        if(tot) printf("%d",f[tot]);
        printf("\n");
    }
}