DP Coins hdoj

Coins

Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse 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.

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.

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

2009 Multi-University Training Contest 3 - Host by WHU 

       題目的意思是在1到m，有多少面值可以被已有的硬币湊成。

      比如例2，擁有2種硬币，1面值的2個，4面值的1個，在1到5内可以湊的有1，2，4，5共4個數字，是以輸出4。

      思路是用前一狀态推後一個狀态，比如要湊j(j<=m)，如果j-v[i]可以被湊成，那麼加上目前的v[i]，j也是可以湊成，但是要注意目前湊j所用的 目前硬币個數為  湊j-v[i]的硬币個數+1。湊j所用的 目前硬币個數<=c[i]