zoukankan      html  css  js  c++  java
  • Codeforces Round #342 (Div. 2) A

    A. Guest From the Past
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Kolya Gerasimov loves kefir very much. He lives in year 1984 and knows all the details of buying this delicious drink. One day, as you probably know, he found himself in year 2084, and buying kefir there is much more complicated.

    Kolya is hungry, so he went to the nearest milk shop. In 2084 you may buy kefir in a plastic liter bottle, that costs a rubles, or in glass liter bottle, that costs b rubles. Also, you may return empty glass bottle and get c (c < b) rubles back, but you cannot return plastic bottles.

    Kolya has n rubles and he is really hungry, so he wants to drink as much kefir as possible. There were no plastic bottles in his 1984, so Kolya doesn't know how to act optimally and asks for your help.

    Input

    First line of the input contains a single integer n (1 ≤ n ≤ 1018) — the number of rubles Kolya has at the beginning.

    Then follow three lines containing integers a, b and c (1 ≤ a ≤ 1018, 1 ≤ c < b ≤ 1018) — the cost of one plastic liter bottle, the cost of one glass liter bottle and the money one can get back by returning an empty glass bottle, respectively.

    Output

    Print the only integer — maximum number of liters of kefir, that Kolya can drink.

    Sample test(s)
    Input
    10
    11
    9
    8
    Output
    2
    Input
    10
    5
    6
    1
    Output
    2
    Note

    In the first sample, Kolya can buy one glass bottle, then return it and buy one more glass bottle. Thus he will drink 2 liters of kefir.

    In the second sample, Kolya can buy two plastic bottle and get two liters of kefir, or he can buy one liter glass bottle, then return it and buy one plastic bottle. In both cases he will drink two liters of kefir.

    题意:塑料瓶牛奶a元 玻璃瓶牛奶b元 玻璃瓶能够卖c元  现有n元 问最多能喝多少瓶牛奶

    题解:两种情况 1.优先买塑料瓶牛奶 ans1

                         2.优先买玻璃瓶牛奶 ans2

    注意细节分析!!

    #include<iostream>
    #include<cstdio>
    #define LL __int64
    using namespace std;
    int main()
    {
      LL a,b,c,n,ans1=0,ans2=0;
      scanf("%I64d%I64d%I64d%I64d",&n,&a,&b,&c);
      LL exm=0;
      exm=n;
      ans1=exm/a;
      exm=exm-ans1*a;
      if(exm>=b)//当前钱数大于b元
      {
          ans1=ans1+(exm-b)/(b-c);//细节
          ans1++;
      }
      if(n>=b)
      {
          ans2=(n-b)/(b-c);
          ans2++;
          n=n-ans2*(b-c);
      }
      ans2+=n/a;
      if(ans1>ans2)
        printf("%I64d
    ",ans1);
      else
        printf("%I64d
    ",ans2);
       return 0;
    }
    

      

  • 相关阅读:
    SpringBoot进入debug模式
    windows上安装ElasticSearch
    Python操作Redis
    JVM: OOP模型 & 对象内存结构 & 计算对象大小 & 指针压缩 & 预估调优
    JVM:执行引擎&JIT&逃逸分析
    man -k或apropos报nothing appropriate解决办法
    JVM:String底层
    JVM: 内存模型
    JVM: 字节码解析
    mac不能启动finder的解决方案
  • 原文地址:https://www.cnblogs.com/hsd-/p/5184929.html
Copyright © 2011-2022 走看看