男人八题coins

#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<set>
#include<cstdlib>
using namespace std;
int i,j,k,va[200],am[200],dp[100005],sum[100005],ans,n,m;
int main()
{
while(scanf("%d%d",&n,&m),n+m)
{
ans = 0;
memset(dp,0,sizeof(dp));
dp[0] = 1;
for(i=0;i<n;i++)
scanf("%d",&va[i]);
for(i=0;i<n;i++)
scanf("%d",&am[i]);
for(i=0;i<n;i++)
{
memset(sum,0,sizeof(sum));
//更新每个价值状态下该物品所用个数；
for(j=va[i];j<=m;j++)
{
if(dp[j-va[i]]&&!dp[j]&&sum[j-va[i]]<am[i])
{
ans ++;
dp[j] = 1;
sum[j] = sum[j-va[i]]+1;
//更新该价值为可以得到且更新所用该物品所用数量
}

}
}
printf("%d\n",ans);
}
return 0;
}