最优程序

program  zuiyou;
const
  maxl=1000;
type
     sta=record
           m:array[1..5]of longint;
           last,done,num,la:longint;
         end;
//sta.la为了记录搜索序列，方便后来打印，sta.last模拟数据栈，sta.num表示当前数据栈前面有多少数据；sta.done表示生成当前状态所用方案
var
     q:array[1..maxl]of sta;
     b:array[1..5]of longint;
     head,tail,num:longint;
     i,n:longint;
     now,new:sta;
     flag:boolean;

procedure print(k:longint);
var
  i:longint;
begin
//递归输出方案
     if q[k].la<>q[q[k].la].la then print(q[k].la);
     if q[k].done=1 then write('add ');
     if q[k].done=2 then write('sub ');
     if q[k].done=3 then write('mul ');
     if q[k].done=4 then write('div ');
     if q[k].done=5 then write('dup ');
end;

function getans(now:sta):boolean;
var
  i,j:longint;
begin
     getans:=true;
     for i:=1 to n do
      if now.m[i]<>b[i] then exit(false);
end;
//是否可以进行除法运算
function candiv(now:sta):boolean;
var
  i:longint;
begin

     candiv:=true;
     if now.num<=0 then exit(false);
     for i:=1 to n do
     if now.m[i]=0 then exit(false);
end;

begin
      assign(input,'win.in');
      assign(output,'win.out');
      reset(input);
      rewrite(output);

      //initialization
      fillchar(q,sizeof(q),0);

      readln(n);
      for i:=1 to n do read(q[1].m[i]); readln;
      for i:=1 to n do read(b[i]);readln;
      q[1].last:=1;
      q[1].la:=1;

      head:=0;tail:=1;
      while head<tail do
       begin
           inc(head);
           now:=q[head];
           //can add and sub
           if now.num>=1 then
            begin
                 //add
                 new:=now;
                 new.done:=1; flag:=false;
                 new.num:=now.num-1;
                 if new.num>0 then new.last:=q[now.last].last
                  else new.last:=tail+1;
                 new.la:=head;
                    //jian yan new shi sou man zu tiao jian
                 for i:=1 to n do
                   begin
                      new.m[i]:=now.m[i]+q[now.last].m[i];
                      if new.m[i]>3000 then
                       begin
                           flag:=true;
                           break;
                       end;
                   end;

                 if not flag then begin
                   inc(tail); q[tail]:=new;
                   if getans(new) then begin print(tail); writeln;halt;end;
                 end;

                 //sub
                 new:=now;
                 new.done:=2;  flag:=false;
                 new.num:=now.num-1;
                 if new.num>0 then new.last:=q[now.last].last
                              else new.last:=tail+1;
                 new.la:=head;
                 flag:=false;

                 for i:=1 to n do
                   begin
                     new.m[i]:=q[now.last].m[i]-now.m[i];
                     if new.m[i]>3000 then
                       begin
                           flag:=true;
                           break;
                       end;
                   end;

                     if not flag then begin
                       inc(tail); q[tail]:=new;
                       if getans(new) then begin print(tail);writeln;halt;end;
                     end;
                 //mul
                 new:=now; flag:=false;
                 new.done:=3;
                 new.num:=now.num-1;
                 if new.num>0 then new.last:=q[now.last].last
                              else new.last:=tail+1;
                 new.la:=head;

                 for i:=1 to n do
                  begin
                   new.m[i]:=q[now.last].m[i]* now.m[i];
                   if new.m[i]>30000 then begin flag:=true; break;end;
                  end;

                     if not flag then begin
                       inc(tail); q[tail]:=new;
                       if getans(new) then begin print(tail); writeln;halt;end;
                     end;

            end;


            if candiv(now) then
             begin
                 new:=now;
                 new.done:=4;
                 new.num:=now.num-1;
                 if new.num>0 then new.last:=q[now.last].last
                  else new.last:=tail+1;
                 for i:=1 to n do new.m[i]:=q[now.last].m[i]div now.m[i];

                 inc(tail); q[tail]:=new;
                 if getans(new) then begin print(tail);  writeln;halt;end;
             end;

             //dup
                 new:=now;
                 new.done:=5;
                 new.num:=now.num+1;
                 new.last:=head;
                 new.la:=head;
                 inc(tail); q[tail]:=new;
       end;

       close(input);
       close(output);
end.

最优程序

算法艺术与信息学竞赛  162页