Hust oj 1384 Leyni, LOLI and Toasts（水题）_leyni喜欢与带帽子的、爱撒谎的loli玩。-优快云博客

本文链接：https://blog.youkuaiyun.com/Sara_YF/article/details/52069119

Leyni, LOLI and Toasts

Time Limit: 1000 MS

Memory Limit: 65536 K

Total Submit: 53(43 users)

Total Accepted: 43(43 users)

Rating:

Special Judge: No

Description

Leyni likes to play with LOLIs, but this winter is so cold in Harbin!

A group of n LOLIs decided to buy b bottles of soft drink to make themselves warmer. Each bottle has d milliliters of the drink. Also they bought l limes and cut each of them into k slices. After that they found p grams of salt.

To make a toast, each LOLI needs x milliliters of the drink, a slice of lime and y grams of salt. Having the average materials, the LOLIs want to make toasts as many as they can. How many toasts can each LOLI makes?

Input

There are multiple test cases. The first line of input is an integer T indicating the number of test cases. Then T test cases follow.

For each test case:

Line 1. This line contains eight positive integers, n, b, d, l, k, p, x, y (1 ≤ n, b, d, l, k, p, x, y ≤ 1000). The numbers are separated by exactly one space.

Output

For each test case:

Line 1. Output the number of toasts each LOLI can make.

Sample Input

3 4 5 10 8 100 3 1

Sample Output

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

int t;
int n,b,d,l,k,p,x,y;

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d%d%d%d%d",&n,&b,&d,&l,&k,&p,&x,&y);
        printf("%d\n",min((b*d)/x,min(l*k,p/y))/n);
    }
}