poj 1742 Coins

#include<iostream>
#include<string.h>
#include<math.h>
#include<fstream>
#include<algorithm>
#include<stdio.h>
#include<queue>
#include<vector>
#define MAXSIZE 100
using namespace std;
int n = 0, m = 0;
int v[101], num[101];
int dp[100001], ans = 0, sum[100001];
int main()
{
//freopen("data_1742.txt","r",stdin);
while(true)
{
ans = 0;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0) break;
for (int i = 1; i <= n; i++)
{
scanf("%d", &v[i]);
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &num[i]);
}
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for (int i = 1; i <= n; i++)
{
memset(sum, 0, sizeof(sum));
for (int j = v[i]; j <= m; j++)
{
if (!dp[j] && dp[j - v[i]] && sum[j - v[i]] < num[i])
{
dp[j] = 1;
sum[j] = sum[j - v[i]] + 1;
ans++;
}
}
}
printf("%d\n", ans);
}

return 0;
}