CodeForces - 151A Soft Drinking

CodeForces - 151A
Soft Drinking
Time Limit: 2000MS
 
Memory Limit: 262144KB
 
64bit IO Format: %I64d & %I64u
Submit Status
Description
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.
Sample Input
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

Hint
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.

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ll long long
#define N 10010
using namespace std;
int main()
{
	int n,k,l,c,d,p,nl,np;
	while(scanf("%d%d%d%d%d%d%d%d",&n,&k,&l,&c,&d,&p,&nl,&np)!=EOF)
	{
		int kk=(k*l)/nl;
		int cc=c*d;
		int pp=p/np;
		int mm=INF;
		mm=min(mm,(int)kk/n);
		mm=min(mm,(int)cc/n);
		mm=min(mm,(int)pp/n);
		printf("%d
",mm);
	}
	return 0;
}