U - Inviting Friends HDU - 3244

You want to hold a birthday party, inviting as many friends as

possible, but you have to prepare enough food for them. For each

person, you need n kinds of ingredient to make good food. You can use

the ingredients in your kitchen, or buy some new ingredient packages.

There are exactly two kinds of packages for each kind of ingredient:

small and large.

We use 6 integers to describe each ingredient: x, y, s1, p1, s2, p2,

where x is the amount (of this ingredient) needed for one person, y is

the amount currently available in the kitchen, s1 and p1 are the size

(the amount of this ingredient in each package) and price of small

packages, s2 and p2 are the size and price of large packages.

Given the amount of money you can spend, your task is to find the

largest number of person who can serve. Note that you cannot buy only

part of a package. Input There are at most 10 test cases. Each case

begins with two integers n and m (1<=n<=100, 1<=m<=100000), the number

of kinds of ingredient, and the amount of money you have. Each of the

following n lines contains 6 positive integers x, y, s1, p1, s2, p2 to

describe one kind of ingredient (10<=x<=100, 1<=y<=100, 1<=s1<=100,

10<=p1<=100, s1<s2<=100, p1<p2<=100). The input ends with n = m = 0.

Output For each test case, print the maximal number of people you can

serve. Sample Input

2 100

10 8 10 10 13 11

12 20 6 10 17 24

3 65

10 5 7 10 13 14

10 5 8 11 14 15

10 5 9 12 15 16

0 0

Sample Output

5

2

思路