light oj 1231 - Coin Change (I)(多重背包)

1231 - Coin Change (I)

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

In a strange shop there are n types of coins of value A₁, A₂ ... A_n. C₁, C₂, ... C_n denote the number of coins of value A₁, A₂ ... A_n respectively. You have to find the number of ways you can make K using the coins.

For example, suppose there are three coins 1, 2, 5 and we can use coin 1 at most 3 times, coin 2 at most 2 times and coin 5 at most 1 time. Then if K = 5 the possible ways are:

1112

122

5

So, 5 can be made in 3 ways.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing two integers n (1 ≤ n ≤ 50) and K (1 ≤ K ≤ 1000). The next line contains 2n integers, denoting A₁, A₂ ... A_n, C₁, C₂ ... C_n (1 ≤ A_i ≤ 100, 1 ≤ C_i ≤ 20). All A_i will be distinct.

Output

For each case, print the case number and the number of ways K can be made. Result can be large, so, print the result modulo 100000007.

Sample Input	Output for Sample Input
2 3 5 1 2 5 3 2 1 4 20 1 2 3 4 8 4 2 1	Case 1: 3 Case 2: 9

解：因为有数量限制，所以枚举数量转01背包

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5+7;
const LL mod = 100000007;
int a[N], num[N], use[1007];
LL dp[N];

int main()
{
    int t, ncase=1;
    scanf("%d", &t);
    while(t--)
    {
        int n, m;
        scanf("%d %d", &n, &m);
        for(int i=1;i<=n;i++) scanf("%d", &a[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++)
        {
            for(int j=m;j>=a[i];j--)
            {
                for(int k=1;k<=num[i];k++)
                {
                    if(j-a[i]*k<0) break;
                    dp[j]=(dp[j]+dp[j-a[i]*k])%mod;
                }
            }
        }
        printf("Case %d: %lld\n",ncase++,dp[m]%mod);
    }
    return 0;
}