题库练习 Soft Drinking
← 上一题 下一题 →

A8433 | Soft Drinking

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

This winter is so cold in Nvodsk! A group of $n$ friends decided to buy $k$ bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has $l$ milliliters of the drink. Also they bought $c$ limes and cut each of them into $d$ slices. After that they found $p$ grams of salt.

To make a toast, each friend needs $nl$ milliliters of the drink, a slice of lime and $np$ grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?

输入格式

The first and only line contains positive integers $n$ , $k$ , $l$ , $c$ , $d$ , $p$ , $nl$ , $np$ , not exceeding $1000$ and no less than $1$ . The numbers are separated by exactly one space.

输出格式

Print a single integer — the number of toasts each friend can make.

输入输出样例

输入 #1
3 4 5 10 8 100 3 1
输出 #1
2
输入 #2
5 100 10 1 19 90 4 3
输出 #2
3
输入 #3
10 1000 1000 25 23 1 50 1
输出 #3
0
C++ 编辑器
输入
输出