跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2965. Soft Drinking

    ID: 2971 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 1 上传者: 标签>模拟数学编程与模拟入门难度共享题库Codeforces英文题面题目来源题面语言

Soft Drinking

题目描述

A. Soft Drinking
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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?

Input

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.

Output

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

Examples
Input
3 4 5 10 8 100 3 1
Output
2
Input
5 100 10 1 19 90 4 3
Output
3
Input
10 1000 1000 25 23 1 50 1
Output
0
Note

A comment to the first sample:

Overall the friends have 4*5=20 milliliters of the drink, it is enough to make 20/3=6 toasts. The limes are enough for 10*8=80 toasts and the salt is enough for 100/1=100 toasts. However, there are 3 friends in the group, so the answer is min(6,80,100)/3=2.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2644 题。保留原作者与原赛事署名。