hdu 2844 Coins【多重背包】

题目链接：https://vjudge.net/contest/228640#problem/F

转载于：http://www.voidcn.com/article/p-mxcorksq-gh.html

题目大意：

给定N种钱，每种面值Ai，数量Ci，问可凑出的总价值中有多少种在(0,M]范围之间

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int a[], c[];
int dp[], use[];
int main()
{
    int n, m;
    while (scanf("%d%d", &n, &m) ==  && n&&m)
    {
        memset(dp, , sizeof(dp));
        for (int i = ; i <= n; i++)
            scanf("%d", &a[i]);
        for (int i = ; i <= n; i++)
            scanf("%d", &c[i]);
        dp[] = ;
        int ans = ;
        for (int i = ; i <= n; i++)
        {
            memset(use, , sizeof(use));
            for (int j = a[i]; j <= m; j++)
            {
                if (dp[j] ==  && dp[j - a[i]] ==  && use[j - a[i]]<c[i])
                {
                    dp[j] = ;
                    use[j] = use[j - a[i]] + ;
                    ans++;
                }
            }
        }
        printf("%d\n", ans);
    }
    return ;
}

2018-05-22