zoukankan      html  css  js  c++  java
  • 早晨训练赛第一场 A题

    早晨训练赛第一场 A题

    A - Nuts
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    You have a nuts and lots of boxes. The boxes have a wonderful feature: if you put x(x ≥ 0) divisors (the spacial bars that can divide a box) to it, you get a box, divided into x + 1 sections.

    You are minimalist. Therefore, on the one hand, you are against dividing some box into more than k sections. On the other hand, you are against putting more than v nuts into some section of the box. What is the minimum number of boxes you have to use if you want to put all the nuts in boxes, and you have b divisors?

    Please note that you need to minimize the number of used boxes, not sections. You do not have to minimize the number of used divisors.

    Input

    The first line contains four space-separated integers k, a, b, v (2 ≤ k ≤ 1000; 1 ≤ a, b, v ≤ 1000) — the maximum number of sections in the box, the number of nuts, the number of divisors and the capacity of each section of the box.

    Output

    Print a single integer — the answer to the problem.

    Sample Input

    Input
    3 10 3 3
    Output
    2
    Input
    3 10 1 3
    Output
    3
    Input
    100 100 1 1000
    Output
    1

    Hint

    In the first sample you can act like this:

    • Put two divisors to the first box. Now the first box has three sections and we can put three nuts into each section. Overall, the first box will have nine nuts.
    • Do not put any divisors into the second box. Thus, the second box has one section for the last nut.

    In the end we've put all the ten nuts into boxes.

    The second sample is different as we have exactly one divisor and we put it to the first box. The next two boxes will have one section each.

    本来水题我是不打算写题解的,然而这题。。。只能说自己傻逼。。。。。

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<algorithm>
    
    using namespace std;
    
    const int maxn=1000100;
    const int INF=(1<<29);
    
    int k,a,b,v;
    
    int main()
    {
        while(cin>>k>>a>>b>>v){
            int cur=0;
            for(int i=1;;i++){
                int cnt=1;
                cur+=v;
                while(b){
                    if(cnt==k) break;
                    cur+=v;
                    b--;
                    cnt++;
                }
                if(cur>=a){
                    cout<<i<<endl;
                    break;
                }
            }
        }
        return 0;
    }
    View Code
    没有AC不了的题,只有不努力的ACMER!
  • 相关阅读:
    一文梳理Ubuntu下Eigen矩阵运算库总结教程
    Ubuntu下安装与使用Eigen矩阵运算库教程
    Ubuntu下cmake教程实践从入门到会用
    collection of vim vim tutorial for beginner
    利用ipython实现多线程
    如何快速地从mongo中提取数据到numpy以及pandas中去
    Git Push 避免用户名和密码方法
    如何使用scikit—learn处理文本数据
    format格式
    fk输入地壳模型容易出错的地方
  • 原文地址:https://www.cnblogs.com/--560/p/4527290.html
Copyright © 2011-2022 走看看