搜索体

#include<iostream>
#include<cstdio >
#include<queue>
#include<algorithm>
#include<cstring>
#include<math.h>
using namespace std;
int s;
int ans[70000];
double sep=0.000001;
void wout(int x)
{
    for(int i=1;i<=x;i++)
    printf("%d ",ans[i]);
    return ;
}
void dfs(int tot,double all,int x,int last)
{
    ans[x]=last;
    //剪枝
    if(tot==s&&fabs(all-1)<=sep)    {wout(x);exit(0);}
    if(all+1.0/last*(((s-tot)/last)+1)<1-sep)    return;
    if(all+1.0/(s-tot)>1+sep)    return ;
    for(int i=last;i<=s-tot;i++)
        dfs(tot+i,all+(double)(1.0/i),x+1,i); 
}
int main()
{
    cin>>s;
    dfs(0,0.0,0,2);
    return 0;
}