LightOJ 1231 Coin Change (I) (线性dp 背包计数)

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/44828199

1231 - Coin Change (I)

Time Limit: 1 second(s)

Memory Limit: 32 MB

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

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

1112

122

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 integersn (1≤ n ≤ 50) andK (1 ≤ K ≤ 1000). The nextline contains2n integers, denotingA₁, A₂ ...A_n, C₁, C₂ ... C_n (1 ≤ A_i≤ 100, 1 ≤ C_i ≤ 20). AllA_iwill be distinct.

Output

For each case, print the case number and the number of waysKcan be made. Result can be large, so, print the result modulo100000007.

Sample Input

Output for Sample Input

3 5

1 2 5 3 2 1

4 20

1 2 3 4 8 4 2 1

Case 1: 3

Case 2: 9

题目链接：http://lightoj.com/volume_showproblem.php?problem=1231

题目大意：有n个数a[i]，每个数有c[i]个，问用这些数相加得到m有多少种方法

题目分析：裸的背包计数问题，dp[i][j]表示用前i个数字组成数字j的方案数，对于每个数字a[i]我们可以用c[1],c[2]...c[i]次，当然也可以不用，最后dp[n][K]就是答案，详细看程序吧，注意这题是对1e8取余不是1e9

#include <cstdio>
#include <cstring>
int const MAX = 1005;
int const MOD = 1e8 + 7;
int dp[55][MAX];
int a[MAX], c[MAX];

int main()
{
    int T;
    scanf("%d", &T);
    for(int ca = 1; ca <= T; ca++)
    {
        int n, K;
        scanf("%d %d", &n, &K);
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        for(int i = 1; i <= n; i++)
            scanf("%d", &c[i]);
        dp[0][0]= 1;
        for(int i = 1; i <= n; i++) //枚举物品种类
            for(int j = 0; j <= K; j++) //枚举背包容量
                for(int k = 0; k <= c[i]; k++)  //枚举物品个数,0表示不放
                    if(j - k * a[i] >= 0)   //若当前背包容量够放则放
                        dp[i][j] = (dp[i][j] + dp[i - 1][j - k * a[i]]) % MOD;
        printf("Case %d: %d\n", ca, dp[n][K]);
    }
}