zoukankan      html  css  js  c++  java
  • Codeforces Round #342 (Div. 2)-A. Guest From the Past

    time limit per test1 second
    memory limit per test256 megabytes
    inputstandard input
    outputstandard 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.

    一个比较坑的题,自己仔细推一下。

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <cmath>
    #include <queue>
    #include <stack>
    #include <string>
    #include <set>
    #include <map>
    #include <list>
    #include <vector>
    #include <functional>
    #include <algorithm>
    using namespace std;
    
    typedef long long LL;
    
    typedef unsigned long long ULL;
    
    typedef pair<int,int>PII;
    
    typedef vector<int>VI;
    
    typedef vector<LL>VL;
    
    const int INF = 0x3f3f3f3f;
    
    const double eps = 1e-6;
    
    const double Pi = acos(-1.0);
    
    int main()
    {
        ULL n,a,b,c;
    
        cin>>n>>a>>b>>c;
    
    
        if(a>n&&b>n)
        {
            cout<<0<<endl;
        }
        else if(a<=n&&b>n)
        {
            cout<<n/a<<endl;
        }
        else if(a>n&&b<=n)
        {
            cout<<(n-c)/(b-c)<<endl;
        }
        else{
    
            if(a<=b-c)
            {
                cout<<n/a<<endl;
            }
            else
            {
                ULL ans = (n-c)/(b-c);
                cout<<ans + (n-(ans*(b-c)+c)+c)/a<<endl;
            }
        }
        return 0;
    }
    
  • 相关阅读:
    node.js 建立live-server
    Django 反向解析
    Boost智能指针——weak_ptr
    boost::intrusive_ptr原理介绍
    shared_ptr 的使用及注意事项
    小感
    JQ对页面中某个DIV的大小变化进行监听
    使用java Apache poi 根据word模板生成word报表
    字节byte自适应转换为B、KB、MB、GB、TB
    jq实现 元素显示后 点击页面的任何位置除元素本身外 隐藏元素
  • 原文地址:https://www.cnblogs.com/juechen/p/5255873.html
Copyright © 2011-2022 走看看