HDU - 2844 Coins(多重背包)

[code]#include <cstdio>
#include <cstring>
const int M = 100010;
const int N = 110;

bool vis[M];
int val
, num
;
int n, m;

void ZeroOnePack(int w) {
    for (int i = m; i >= w; i--)
        if (vis[i - w]) vis[i] = true;
}

void CompletePack(int w) {
    for (int i = w; i <= m; i++)
        if (vis[i - w]) vis[i] = true;
}

void solve() {
    memset(vis, 0, sizeof(vis));
    vis[0] = true;
    for (int i = 0; i < n; i++) {
        if (num[i] * val[i] >= m) 
            CompletePack(val[i]);
        else {
            int t = 1;
            while (t <= num[i]) {
                ZeroOnePack(val[i] * t);
                num[i] -= t;
                t *= 2;
            }
            ZeroOnePack(val[i] * num[i]);
        }
    }
    int ans = 0;

    for (int i = 1; i <= m; i++)
        if (vis[i]) ans++;
    printf("%d\n", ans);
}

void init() {
    for (int i = 0; i < n; i++)
        scanf("%d", &val[i]);
    for (int i = 0; i < n; i++)
        scanf("%d", &num[i]);
}

int main() {
    while (scanf("%d%d", &n, &m) != EOF && n + m) {
        init();
        solve();
    }
    return 0;
}