poj 1742 Coins

Description

People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.

Input

The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.

Output

For each test case output the answer on a single line.

Sample Input

3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0

Sample Output

8
4

Source

LouTiancheng@POJ

 

题目大意：给出一些面值的钞票和每种钞票的张数。问能取到几个不大于cash的值。

 

传说中的ltc男人八题，虽然只是一个典型的多次背包，但时限卡得巨死。我编了拆分方法和单调队列优化两种，都因为常数被卡掉了。。。最后看了网上的标程，用uesd记录取了多少次，n*c的方法过了。程序巨短。

 

AC CODE

program pku_1742;
var f:array[0..100000] of boolean;
      used:array[0..100000] of longint;
      d,vv,v:array[0..1000] of longint;
      n,nn,c,ans,i,j:longint;
begin
  while true do
  begin
      readln(nn,c);
      if (nn=0) and (c=0) then halt;
      for i:=1 to nn do read(vv[i]);
      for i:=1 to nn do read(d[i]);
      fillchar(f,sizeof(f),0);
      f[0]:=true;
      for i:=1 to nn do
      begin
          fillchar(used,sizeof(used),0);
          for j:=vv[i] to c do
              if (used[j-vv[i]]<d[i]) and f[j-vv[i]] and not(f[j]) then
              begin
                  used[j]:=used[j-vv[i]]+1; f[j]:=true;
              end;
      end;
      ans:=0;
      for i:=c downto 1 do
          if f[i] then inc(ans);
      writeln(ans);
  end;
end.