> program zju1005;
> var
> a,b,t,n:longint;
> begin
> repeat
> readln(a,b,n);
> if b=1 then
>   begin
>   if n=1 then writeln('fill B');
>   writeln('success');
>   continue;
>   end;
> if a=1 then
>   begin
>   for t:=1 to n do
>     begin
>     writeln('fill A');
>     writeln('pour A B');
>     end;
>   writeln('success');
>   continue;
>   end;
> t:=0;
> while t<>n do
>   begin
>   writeln('fill A');
>   writeln('pour A B');
>   inc(t,a);
>   if t>=b then
>     begin
>     dec(t,b);
>     writeln('empty B');
>     writeln('pour A B');
>     end;
>   end;
> writeln('success');
> until eof(input);
> end.

• 把每个状态画在直角坐标系上，然后走一走就看出规律了 (0) sunmoonstar_love 2005-08-07 22:14:12
• 我还认真写了一个BFS…… (0) frkstyc 2005-08-07 22:14:23
  • 都是搜，楼主贴的搜法比较简单，我开始写的DFS，挂了 (0) sunmoonstar_love 2005-08-07 22:16:21