> 来来来，贴一个不用那种奇怪的没有证明的结论的真正的DP标程~~`:)
> const
>      n  =6;
> 
> var
>      rock :array[1..n] of longint;
>      opt :array[0..60000] of boolean;
>      print :boolean;
>      mid :longint;
>      r  :integer;
> 
> procedure init;
>      var
>           i :integer;
>      begin
>           mid:=0;
>           print:=true;
>           for i:=1 to n do
>           begin
>                read(rock[i]);
>                mid:=mid+rock[i]*i;
>                if rock[i] mod 2=1 then print:=false;
>           end;
>           readln;
>      end;
> 
> function min(a,b:longint):longint;
>      begin
>          if a<b then min:=a else min:=b;
>      end;
> 
> procedure dp;
>      var
>           max :longint;
>           i :integer;
>           j,k :longint;
>      begin
>           fillchar(opt,sizeof(opt),false);
>           opt[0]:=true;
>           max:=0;
>           print:=true;
>           for i:=1 to n do
>           begin
>               if rock[i]>0 then
>                   for j:=max downto 0 do
>                   if opt[j] then
>                   begin
>                       if opt[mid] then begin writeln('Can be divided.');exit; end;
>                       for k:=1 to rock[i] do
>                       begin
>                            if (j+k*i>mid) or opt[j+k*i] then break;
>                            opt[j+k*i]:=true;
>                       end;
>                   end;
>               max:=max+i*rock[i];
>               if max>mid then max:=mid;
>           end;
>           print:=false;
>      end;
> 
> begin
>      init;
>      r:=0;
>      while mid<>0 do
>      begin
>           inc(r);
>           writeln('Collection #',r,':');
>           if (mid mod 2=0) and not print then
>           begin
>               mid:=mid div 2;
>               dp;
>               if not print then writeln('Can''t be divided.')
>           end else
>               if print then writeln('Can be divided.')
>                        else writeln('Can''t be divided.');
>           writeln;
>           init;
>      end;
> end.

• 这个......我看不懂，即便是看懂了也不会...... (0) palmtenor 2005-04-22 21:57:51
  • ft，完全是初中的数学 (0) frkstyc 2005-04-22 22:00:33
    • 完了被BS了~~~~不过个人觉得还是挺有成就感的,毕竟比赛的时候剪枝比那个玩意好想~~~ (0) palmtenor 2005-04-22 23:45:00
• 按你的方法，我用c++做了一下，ac啦，不过有些还是不懂.... (261) IceAngel 2005-05-27 15:26:58