zoukankan      html  css  js  c++  java
  • 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.

    题解:水题:配饮料的,问每个人能配几瓶;

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    const int INF=0x3f3f3f3f;
    #define SI(x) scanf("%d",&x)
    #define PI(x) printf("%d",x)
    #define P_ printf(" ")
    
    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)){
            printf("%d
    ",min(min(k*l/nl,c*d),p/np)/n);
        }
        return 0;
    }
  • 相关阅读:
    闪回还原点解析
    先有鸡还是先有蛋的争论
    Android缓存处理
    hdu 1398 Square Coins (母函数)
    JSON具体解释
    【LeetCode】String to Integer (atoi) 解题报告
    【Linux探索之旅】第一部分第四课:磁盘分区,并完毕Ubuntu安装
    MySQL排序:SELECT ORDER BY
    架构师速成7.3-devops为什么非常重要
    升级Linux内核导致vmware无法使用(vmnet模块无法编译)解决方式
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5246057.html
Copyright © 2011-2022 走看看