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.
【题目分析】
多重背包问题。
【代码】
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int dp[100005];
int sum[100005];
int v[105],c[105];
int main()
{
int i,j,k,n,m;
while(~scanf("%d%d",&n,&m),n+m)
{
for(i = 1;i<=n;i++)
scanf("%d",&v[i]);
for(i = 1;i<=n;i++)
scanf("%d",&c[i]);
memset(dp,0,sizeof(dp));
dp[0] = 1;
int ans = 0;
for(i=1;i<=n;i++)
{
memset(sum,0,sizeof(sum));
for(j = v[i];j<=m;j++)
if(!dp[j] && dp[j-v[i]] && sum[j-v[i]]<c[i])
dp[j] = 1,sum[j] = sum[j-v[i]]+1,ans++;
}
printf("%d\n",ans);
}
return 0;
}