【CodeForces】 106C 多重背包

C. Buns
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Lavrenty, a baker, is going to make several buns with stuffings and sell them.

Lavrenty has n grams of dough as well as m different stuffing types. The stuffing types are numerated from 1 to m. Lavrenty knows that he has ai grams left of the i-th stuffing. It takes exactly bi grams of stuffing i and ci grams of dough to cook a bun with the i-th stuffing. Such bun can be sold for di tugriks.

Also he can make buns without stuffings. Each of such buns requires c0 grams of dough and it can be sold for d0 tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.

Find the maximum number of tugriks Lavrenty can earn.

Input
The first line contains 4 integers n, m, c0 and d0 (1 ≤ n ≤ 1000, 1 ≤ m ≤ 10, 1 ≤ c0, d0 ≤ 100). Each of the following m lines contains 4 integers. The i-th line contains numbers ai, bi, ci and di (1 ≤ ai, bi, ci, di ≤ 100).

Output
Print the only number — the maximum number of tugriks Lavrenty can earn.

Examples
inputCopy
10 2 2 1
7 3 2 100
12 3 1 10
outputCopy
241
inputCopy
100 1 25 50
15 5 20 10
outputCopy
200
Note
To get the maximum number of tugriks in the first sample, you need to cook 2 buns with stuffing 1, 4 buns with stuffing 2 and a bun without any stuffing.

In the second sample Lavrenty should cook 4 buns without stuffings.

题目大意：给你N个面团，M中配案，给出你一个C0和D0，

下面就是输入M中配案，其中Ai为你有多少的馅，Bi为你做一个这种馅的馅饼需要的馅的数量，

Ci为需要的面的数量，Di为给出这种馅的馅饼能卖多少钱，

C0和D0也就是当他们不放馅只放面的时候做出来能卖出去的钱。

每一种馅的馅饼的数量都是有限制的，并不是无限的

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<set>
#define ll long long
using namespace std;
int main()
{
    int n,m,c0,d0,a,b,c,d;
    int dp[10010];
    memset(dp,0,sizeof(dp));
    cin>>n;
    cin>>m;
    cin>>c0;
    cin>>d0;
    for(int i=c0;i<=n;i++)
        dp[i]=i/c0*d0;
    for(int i=0;i<m;i++)
    {
        cin>>a;
        cin>>b;
        cin>>c;
        cin>>d;
        for(int j=1;j<=a/b;j++)
           for(int k=n;k>=c;k--)
             dp[k]=max(dp[k-c]+d,dp[k]);
    }
    cout<<dp[n]<<endl;
    return 0;
}