poj 1742 coins_多重背包

题意：给你N个种硬币，价值和数量，知道手表不大于m，问能组成（1~m）的价格有多少种情况

套套上次那题的模板直接就行了，http://blog.csdn.net/neng18/article/details/17060539

#include <iostream>#include<cstring>#include<cstdio>using namespace std;#define MAXV 150#define MAXM 100050int cash,n,value[MAXV],c[MAXV],f[MAXM],user[MAXM];int main(){int i,j,max;while(scanf("%d%d",&n,&cash)&&n||cash){for(i=1;i<=n;i++)scanf("%d",&value[i]);for(i=1;i<=n;i++)scanf("%d",&c[i]);memset(f,0,sizeof(f));f[0]=1;max=0;for(i=1;i<=n;i++){memset(user,0,sizeof(user));for(j=value[i];j<=cash;j++)if(!f[j] && f[j-value[i]] && user[j-value[i]]+1<=c[i]){user[j]=user[j-value[i]]+1;f[j]=1;//j为1，即j是可取的，选出可取的最大的j就是答案max++;}}printf("%d\n",max);}return 0;}