题库练习 [COCI-2007_2008-regional]#2 KUHAR
← 上一题 下一题 →

A1141 | [COCI-2007_2008-regional]#2 KUHAR

来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

Lisa works as a waitress in a restaurant. Tonight is her birthday so Lisa asked the chef to prepare his special meal for her friends. The chef's meal is made of N ingredients. To prepare one serving of the meal he needs a certain amount of each ingredient.
There are some ingredients already available in the kitchen and Lisa will buy the rest at the grocery store. The store has all the necessary ingredients, each coming in smaller and larger packages. Lisa has M dollars and wants to spend them so that the chef can make the most servings of his meal.

输入格式

The first line contains two integers N and M, 1 ≤ N ≤ 100, 1 ≤ M ≤ 10000
0.
Each of the following N lines contains 6 positive integers, information about one ingredient. These specify, in order:
• X, 10 ≤ X ≤ 100, the amount of the ingredient needed in one serving;
• Y, 1 ≤ Y ≤ 100, the amount of the ingredient already available in the kitchen;
• SM, 1 ≤ SM < 100, the size of the smaller package at the store;
• PM, 10 ≤ PM < 100, the price of the smaller package;
• SV, SM < SV≤ 100, the size of the larger package; and
• PV, PM < PV≤ 100, the price of the larger package.

输出格式

Output the largest number of servings the chef can make if Lisa spends her money wisely.

输入输出样例

输入 #1
2 100 
10 8 10 10 13 11 
12 20 6 10 17 24
输出 #1
5
输入 #2
3 65 
10 5 7 10 13 14 
10 5 8 11 14 15 
10 5 9 12 15 16 
输出 #2
2
C++ 编辑器
输入
输出