var
  s:array[0..100]of longint;
  i,j,k,l,m,n,sum,now,top:longint;
begin
  readln(n);s[0]:=n-1;
  top:=1;s[1]:=1;sum:=1;now:=1;
  while true do
    begin
      inc(top); s[top]:=now; sum:=sum+now;
      if sum>n then begin
                      sum:=sum-s[top];s[top]:=0;dec(top);inc(now);
                      while sum+1>n do
                        begin
                          sum:=sum-s[top];
                          s[top]:=0;
                          dec(top);
                        end;
                      inc(s[top]);sum:=sum+1;
                      now:=s[top];
                    end;
      if sum=n then
      begin
        for j:=1 to top do write(s[j],' '); writeln;
        if top=1 then exit;
      end;
    end;
end.

能讲一下算法吗?

大哥..顺便到小弟的帖子上出几道题..不要太难..偶才6年级..准备去比赛了

我也一样