CF Buns （01背包问题）

题目：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
input
10 2 2 1
7 3 2 100
12 3 1 10
output
241
input
100 1 25 50
15 5 20 10
output
200

大意：
n:一共有ng面团
m:有m种馅
a[]:每种馅还剩多少
b[],c[]:每做一种馅饼需要bg馅和cg面团
d[]:每一种馅饼可以买多少钱
dp[]:最多可以买多少钱
c[0],d[0]:做馒头需要的面团c[0]g 能买d[0]的钱

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#include <stack>
#include <cmath>
using namespace std;
typedef long long ll;
const int N=20,INF=0x3f3f3f3f;
int a[N],b[N],c[N],d[N];
int dp[1007]={0};
int main()
{
    int n,m;
    scanf("%d%d%d%d",&n,&m,&c[0],&d[0]);
    for(int i=1;i<=m;i++)
        scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
    for(int i=c[0];i<=n;i++)//所有的面团用来做馒头能赚多少
        dp[i]=i/c[0]*d[0];
    for(int i=1;i<=m;i++)
        for(int k=0;k<a[i]/b[i];k++)//有a[i]/b[i]份的馅j就可以循环k次把所有的馅用进去（知道没有馅为止）
            for(int j=n;j>=c[i];j--)
                dp[j]=max(dp[j],dp[j-c[i]]+d[i]);
    printf("%d\n",dp[n]);
}