lightoj1231_多重背包

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

题意：给你不同种类的硬币和个数，让你求组成面值为k的方法数

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <ctime>
#include <queue>
#include <list>
#include <set>
#include <map>
using namespace std;
#define INF 0x3f3f3f3f
#define mod 100000007
typedef long long LL;

int val[55], num[55], dp[55][1005];
int main()
{
    int t, n, k;
    scanf("%d", &t);
    for(int ca = 1; ca <= t; ca++)
    {
        scanf("%d %d", &n, &k);
        for(int i = 1; i <= n; i++)
            scanf("%d", &val[i]);
        for(int i = 1; i <= n; i++){
            scanf("%d", &num[i]);
            num[i] = min(num[i], k / val[i]);
        }
        memset(dp, 0, sizeof(dp));
        for(int i = 0 ; i <= n; i++)
            dp[i][0] = 1;
        for(int i = 1; i <= n; i++)
        {
            for(int j = k; j > 0; j--)
            {
                for(int l = 0; l <= num[i]; l++)
                {
                    if(j - l * val[i] >= 0){
                        dp[i][j] = (dp[i-1][j-l*val[i]] + dp[i][j]) % mod;
                      //  cout << i <<" "<< j <<" "<< dp[i][j] <<endl;
                    }

                }
            }
        }
        printf("Case %d: %d
", ca, dp[n][k]);
    }
    return 0;
}