codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

106C.md (1753B)


      1 Source: https://codeforces.com/problemset/problem/106/C
      2 
      3 C. Buns
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Lavrenty, a baker, is going to make several buns with stuffings and sell them.
     22 
     23 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 *a**i* grams left of the *i*-th stuffing. It takes exactly *b**i* grams of stuffing *i* and *c**i* grams of dough to cook a bun with the *i*-th stuffing. Such bun can be sold for *d**i* tugriks.
     24 
     25 Also he can make buns without stuffings. Each of such buns requires *c*0 grams of dough and it can be sold for *d*0 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.
     26 
     27 Find the maximum number of tugriks Lavrenty can earn.
     28 
     29 Input
     30 
     31 The first line contains 4 integers *n*, *m*, *c*0 and *d*0 (1 ≤ *n* ≤ 1000, 1 ≤ *m* ≤ 10, 1 ≤ *c*0, *d*0 ≤ 100). Each of the following *m* lines contains 4 integers. The *i*-th line contains numbers *a**i*, *b**i*, *c**i* and *d**i* (1 ≤ *a**i*, *b**i*, *c**i*, *d**i* ≤ 100).
     32 
     33 Output
     34 
     35 Print the only number — the maximum number of tugriks Lavrenty can earn.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 10 2 2 1  
     43 7 3 2 100  
     44 12 3 1 10
     45 ```
     46 
     47 Output
     48 
     49 ```
     50 241
     51 ```
     52 
     53 Input
     54 
     55 ```
     56 100 1 25 50  
     57 15 5 20 10
     58 ```
     59 
     60 Output
     61 
     62 ```
     63 200
     64 ```
     65 
     66 Note
     67 
     68 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.
     69 
     70 In the second sample Lavrenty should cook 4 buns without stuffings.