codeforces Nuts
来源:互联网 发布:松下fpg软件下载 编辑:程序博客网 时间:2024/06/03 08:28
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.
题意:一个箱子可以最多被分成k部分,现在有a个坚果,有b个隔板,x个隔板可以将箱子分成(x+1)个部分每一部分最多装v个坚果,求将这些坚果全部装进箱子里,最少用几个箱子?
#include <iostream>#include <cmath>using namespace std;int main(){ int k,a,b,v; cin>>k>>a>>b>>v; int s,flag=0; if(k<b+1) s=k*v; if(k>=b+1) { s=(b+1)*v; flag=1; } if(s>=a) cout<<"1"<<endl; else { if(flag==1) { int p=ceil(1.0*(a-s)/v)+1; cout<<p<<endl; } if(flag==0) { b=b-k+1; int p=s,num=1; while(b>=k-1&&s<a) { b-=k-1; s+=p; num++; } if(s>=a) { cout<<num<<endl; } else { s+=(b+1)*v; if(s>=a) cout<<num+1<<endl; else { num+=ceil(1.0*(a-s)/v)+1; cout<<num<<endl; } } } } return 0;}
- codeforces Nuts
- CodeForces 402A Nuts
- codeforces#236_div2_A nuts 贪心
- Nuts
- Codeforces Round #236 (Div. 2) A. Nuts
- Codeforces Round #236 (Div. 2) A. Nuts
- codeforces Round #236(DIV 2)A. Nuts
- CodeForces 402A Nuts (二分)
- Codeforces Round #332 (Div. 2) E. Sandy and Nuts
- Codeforces 599E Sandy and Nuts 状压DP
- codeforces Round #236(DIV 2)A. Nuts(数学类计算题)
- A. Nuts
- nuts软件
- Uva-10944-Nuts for nuts..
- UVA10944 - Nuts for nuts.. 状态压缩
- codeforce 402A - Nuts
- CF 402A - Nuts
- Codeforence 402 A. Nuts
- js播放wav格式的录音文件
- 算法:堆排序
- [git]如何repo sync一份干净的code
- HDOJ 5547 Sudoku (DFS 数独填数+回溯)
- ashx页面中 Session值出现“未将对象引用设置到对象的实例”错误
- codeforces Nuts
- 又见KeepAlive
- win7下用VC6.0连接MySQL5.1数据库
- 【leetcode】【35】Search Insert Position
- ASLA Codec架构
- UML总结之用例图
- 《现代操作系统》读书笔记---进程与线程篇
- HDU_1043 Eight
- poj 1220 NUMBER BASE CONVERSION 【栈】