CF151A.Soft Drinking

入门

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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?

今年冬天,诺沃茨克(Nvodsk)的天气异常寒冷!一群 nn 位朋友决定购买 kk 瓶名为“轻啜暖饮(Take-It-Light)”的软饮料来稍稍暖身。每瓶饮料容量为 ll 毫升。此外,他们还买了 cc 个青柠,并将每个青柠切成了 dd 片。之后,他们又找到了 pp 克盐。

每位朋友要完成一次干杯(toast),需要 nlnl 毫升饮料、11 片青柠以及 npnp 克盐。朋友们希望在保证每人饮用量完全相同的前提下,尽可能多地完成干杯。请问:每位朋友最多能完成多少次干杯?

输入格式

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.

第一行且唯一一行包含正整数 nn、kk、ll、cc、dd、pp、nlnl、npnp,这些数均不超过 10001000 且不小于 11。数字之间恰好由一个空格分隔。

输出格式

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

说明/提示

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.

对第一个样例的说明:

朋友们总共拥有 4×5=204 \times 5 = 20 毫升饮料,足以进行 20/3=620 / 3 = 6 次祝酒。青柠足以支持 10×8=8010 \times 8 = 80 次祝酒,而盐足以支持 100/1=100100 / 1 = 100 次祝酒。然而,该小组共有 3 位朋友,因此答案为 min⁡(6, 80, 100)/3=2\min(6,\,80,\,100) / 3 = 2。

输入解题思路,AI测评打分。不知道怎么写?

首页