Poj 1032 Parliament

#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");
    }
}