zoukankan      html  css  js  c++  java
  • HDOJ(HDU) 1587 Flowers(水、、)

    Problem Description
    As you know, Gardon trid hard for his love-letter, and now he’s spending too much time on choosing flowers for Angel.
    When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.
    “How can I choose!” Gardon shouted out.
    Finally, Gardon– a no-EQ man decided to buy flowers as many as possible.
    Can you compute how many flowers Gardon can buy at most?

    Input
    Input have serveral test cases. Each case has two lines.
    The first line contains two integers: N and M. M means how much money Gardon have.
    N integers following, means the prices of differnt flowers.

    Output
    For each case, print how many flowers Gardon can buy at most.
    You may firmly assume the number of each kind of flower is enough.

    Sample Input
    2 5
    2 3

    Sample Output
    2

    HintHint
    Gardon can buy 5=2+3,at most 2 flower, but he cannot buy 3 flower with 5 yuan.

    大概题意:
    输入m n
    再输入m种花的价格
    就是你有n元钱,需要买最多的花,问最多能买多少朵花!
    一种花你可以买很多朵!!!
    所以,只要找到最低价格的花就可以了。

    import java.util.Scanner;
    
    public class Main{
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            while(sc.hasNext()){
                int a = sc.nextInt();
                int b = sc.nextInt();
    
                int min = sc.nextInt();
                a--;
                int t;
                while(a-->0){
                    t = sc.nextInt();
                    if(t<min){
                        min=t;
                    }
                }
                System.out.println(b/min);
            }
        }
    }
    
  • 相关阅读:
    linux 创建python虚拟环境
    dic1.update(dic2)和{**dic2, **dic1}的区别
    redis
    电脑开机一卡一卡的,重启就好了
    股东大会和董事会的区别
    word空白框打钩
    计划资产回报
    成本法为什么要转权益法
    租赁负债
    AIDA64序列号
  • 原文地址:https://www.cnblogs.com/webmen/p/5739284.html
Copyright © 2011-2022 走看看