HDU - 2844 Coins

题意：问可以得到多少种可能凑成的价格

思路：完全背包的模板

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 110;

int val[MAXN],num[MAXN];
int f[100005],n,v;

int main(){
	while (scanf("%d%d",&n,&v) != EOF && n+v){
		for (int i = 1; i <= n; i++)
			scanf("%d",&val[i]);
		for (int i = 1; i <= n; i++)
			scanf("%d",&num[i]);
		memset(f,0,sizeof(f));
		f[0] = 1;
		for (int i = 1; i <= n; i++){
			int x = val[i],y = num[i];
			int t = 1;
			while (y){
				for (int j = v; j >= x*t; j--)
					if (f[j-x*t])
						f[j] = 1;
				y -= t;
				t = min(y,2*t);
			}
		}
		int ans = 0;
		for (int i = 1; i <= v; i++)
			ans += f[i];
		printf("%d\n",ans);
	}
}

HDU - 2844 Coins,布布扣,bubuko.com

HDU - 2844 Coins

原文：http://blog.csdn.net/u011345136/article/details/21108799