题意:价值m一下可达的背包情况有多少种。
混合背包模板。
#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 100010;
int dp[N];
int v[N], w[N];
int a[N];
int n, m;
int main()
{
while( ~scanf("%d%d", &n, &m) ) {
if( n == m && n == 0 )
break;
for( int i = 1; i <= n; ++i ) {
scanf("%d", &a[i]);
}
int tot = 0;
memset( dp, 0, sizeof( dp ) );
for( int i = 1, x; i <= n; ++i ) {
scanf("%d", &x);
int cur = 1;
while( x >= cur ) {
v[++tot] = cur * a[i];
x -= cur;
cur <<= 1;
}
if( x > 0 )
v[++tot] = x * a[i];
}
for( int i = 1; i <= tot; ++i ) {
for( int j = m; j >= v[i]; --j ) {
dp[j] = max( dp[j], dp[j-v[i]]+v[i] );
}
}
int ans = 0;
for( int i = 1; i <= m; ++i )
ans += ( i == dp[i] );
printf("%d\n", ans);
}
return 0;
}