program jiulianhuan;
var ring:array[1..10]of 0..1;
    input,output:text;
    n,step,temp:integer;
procedure gcode;
var i:integer;
begin
     for i:=1 to 9 do
     if ring[i+1]=1 then
        if ring[i]=1 then ring[i]:=0;
end;
begin
     fillchar(ring,sizeof(ring),0);
     readln(input,n);
     if n>341 then write(output,'-1')
     else
     begin
          step:=341-n;
          temp:=0;
          while step>0 do
          begin
               inc(temp);
               ring[temp]:=step mod 2;
               step:=step div 2;
          end;
          gcode;
          for temp:=1 to 9 do write(output,ring[temp]);
     end;

end.

试过但不行!!

我认为还是那个gcode可能有问题~~~~不太确认~~~

递推 
《算法艺术》31页有道一样的题

楼主是不是广州的?