Codeforces Round #236 (Div. 2) A. Nuts
来源:互联网 发布:修理图片的软件 编辑:程序博客网 时间:2024/05/01 00:31
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.
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.
Print a single integer — the answer to the problem.
3 10 3 3
2
3 10 1 3
3
100 100 1 1000
1
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.
这道题的难点就在于要求的输入太多了,难以理清其中的关系
但是你认真思考的话就会发现首先要考虑b+1 和 k 哪个较大,取较大者可以保证当前对
箱子利用率最大,还要考虑b用完了,只能一个箱子一个箱子装
代码如下:
#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <vector>#include <map>#define MAXN 100#define INF 0x7FFFFFFF#define ll long longusing namespace std;int main(void){int k, a, b, v;while(cin >> k >> a >> b >> v){int sum = 0;int num = 0;while(b != 0){if(b+1 > k){sum += k*v;b -= (k-1);num++;}else{sum += (b+1)*v;b = 0;num++;}if(sum > a) break;}while(sum < a){sum += v;num++;}cout << num << endl;}return 0;}
上面的代码跪了。。。原因是while( b! = 0 )的循环内,break的条件应该是sum >= a
#include <algorithm>#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <vector>#include <map>#define MAXN 100#define INF 0x7FFFFFFF#define ll long longusing namespace std;int main(void){int k, a, b, v;while(cin >> k >> a >> b >> v){int sum = 0;int num = 0;while(b != 0){if(b+1 > k){sum += k*v;b -= (k-1);num++;}else{sum += (b+1)*v;b = 0;num++;}if(sum >= a) break;}while(sum<a){sum += v;num++;}cout << num << endl;}return 0;}
- Codeforces Round #236 (Div. 2) A. Nuts
- Codeforces Round #236 (Div. 2) A. Nuts
- codeforces Round #236(DIV 2)A. Nuts
- codeforces Round #236(DIV 2)A. Nuts(数学类计算题)
- Codeforces Round #332 (Div. 2) E. Sandy and Nuts
- Codeforces Round #236 (Div. 2)A
- Codeforces round #236Div.2--A;B
- Codeforces Round #236 (Div. 2)------A,B
- codeforces round #236 div.2 A
- CodeForces 402A Nuts
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- codeforces Round # 236(DIV 2)B. Trees in a Row
- Codeforces Round #236 (Div. 2)__Trees in a Row
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- Codeforces Round #236 (Div. 2)A(贪心、数学)
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- 设计模式学习之——六大设计原则之三:依赖倒置原则
- 【转】最大和子序列、最长递增子序列、最长公共子串、最长公共子序列、字符串编辑距离
- iOS7后台机制详解
- 浅谈编译器和解释器
- Spring Filter过滤器,Spring拦截未登录用户权限限制
- Codeforces Round #236 (Div. 2) A. Nuts
- Codeforces Round #236 (Div. 2) B. Trees in a Row
- .NET:一个非常好用的SQL数据库处理类
- Nuts
- codeforces Round #236(DIV 2)A. Nuts(数学类计算题)
- UVa 400 Unix的ls命令
- Codeforces Round #236 (Div. 2)B
- 对于机器人,电脑与有机体生命之间的进化比较(好几年前自己写的,很有感触)
- java删除文件(单个文件,文件夹,子文件夹) 20090812(jsp+servlet+access)