Leyni, LOLI and Toasts

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?

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.

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

3 4 5 10 8 100 3 1

#include<cstdio>
#include<cmath>
#include<queue>
#include<iostream>
using namespace std;
int min(int x,int y)
{
    return x<y? x:y;
}
int main()
{
    int  n, b, d, l, k, p, x, y;
    int T;
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%d%d%d%d%d%d%d%d",&n,&b,&d,&l,&k,&p,&x,&y);
        /*    if(n>b)
            {
                printf("0\n");
            }*/
            //else
        //    {
                int num1=b*d/(n*x);
                int num2=l*k/n;
                int num3=p/(y*n);
                printf("%d\n",min(num1,min(num2,num3)));
        //    }
        }
    }
    return 0;
}