People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0
Sample Output
8
4
题意:给你一个n和一个m,紧接着n个数是硬币的面值,再n个数分别代表改面值的数量。求这些硬币可以组成1-m中的几个面值。
思路:这叼题目搞我,看起来就一多重背包,结果普通地用二进制切分然后dp然后数答案居然会t,好过分一题目,他卡常,不让我用板子。其实做法也不难,看代码。
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<math.h>
#include<vector>
#include<stack>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<stdio.h>
#include<functional>
#include<time.h>
#pragma warning(disable:6031)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 10;
const ll mode = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979323846264338327950;
template <class T> inline T min(T a, T b, T c) { return min(min(a, b), c); }
template <class T> inline T max(T a, T b, T c) { return max(max(a, b), c); }
template <class T> inline T min(T a, T b, T c, T d) { return min(min(a, b), min(c, d)); }
template <class T> inline T max(T a, T b, T c, T d) { return max(max(a, b), max(c, d)); }
int dp[maxn];
int a[maxn], c[maxn];
int sum[maxn];
int main()
{
int n, m;
while (scanf("%d %d", &n, &m))
{
if (m == 0 && n == 0) return 0;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
scanf("%d", &c[i]);
memset(dp, 0, sizeof(dp));
dp[0] = 1;
int ans = 0;
for (int i = 0; i < n; i++)
{
memset(sum, 0, sizeof(sum));
for (int j = a[i]; j <= m; j++)
{
if (!dp[j] && dp[j - a[i]] && sum[j - a[i]] < c[i])
{
dp[j] = 1;
sum[j] = sum[j - a[i]] + 1;
ans++;
}
}
}
printf("%d\n", ans);
}
return 0;
}