ZeptoLab Code Rush 2015---C. Om Nom and Candies
来源:互联网 发布:淘宝排行查询 编辑:程序博客网 时间:2024/05/20 15:58
A sweet little monster Om Nom loves candies very much. One day he found himself in a rather tricky situation that required him to think a bit in order to enjoy candies the most. Would you succeed with the same task if you were on his place?
One day, when he came to his friend Evan, Om Nom didn’t find him at home but he found two bags with candies. The first was full of blue candies and the second bag was full of red candies. Om Nom knows that each red candy weighs Wr grams and each blue candy weighs Wb grams. Eating a single red candy gives Om Nom Hr joy units and eating a single blue candy gives Om Nom Hb joy units.
Candies are the most important thing in the world, but on the other hand overeating is not good. Om Nom knows if he eats more than C grams of candies, he will get sick. Om Nom thinks that it isn’t proper to leave candy leftovers, so he can only eat a whole candy. Om Nom is a great mathematician and he quickly determined how many candies of what type he should eat in order to get the maximum number of joy units. Can you repeat his achievement? You can assume that each bag contains more candies that Om Nom can eat.
Input
The single line contains five integers C, Hr, Hb, Wr, Wb (1 ≤ C, Hr, Hb, Wr, Wb ≤ 109).
Output
Print a single integer — the maximum number of joy units that Om Nom can get.
Sample test(s)
Input
10 3 5 2 3
Output
16
Note
In the sample test Om Nom can eat two candies of each type and thus get 16 joy units.
如果某种糖的W值
如果2种糖的W值均
设蓝色的糖拿了X个,且
/************************************************************************* > File Name: Z-C.cpp > Author: ALex > Mail: zchao1995@gmail.com > Created Time: 2015年04月05日 星期日 13时09分31秒 ************************************************************************/#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <queue>#include <stack>#include <map>#include <bitset>#include <set>#include <vector>using namespace std;const double pi = acos(-1.0);const int inf = 0x3f3f3f3f;const double eps = 1e-15;typedef long long LL;typedef pair <int, int> PLL;int main(){ LL C, Hr, Hb, Wr, Wb; while (cin >> C >> Hr >> Hb >> Wr >> Wb) { if (C < Wr && C < Wb) { cout << 0 << endl; continue; } if (C < Wr && C >= Wb) { cout << C / Wb * Hb << endl; continue; } if (C < Wb && C >= Wr) { cout << C / Wr * Hr << endl; continue; } LL ans = 0; for (LL i = 0; i * i <= C; ++i) { if (C - i * Wb >= 0) { ans = max(ans, i * Hb + (C - i * Wb) / Wr * Hr); } if (C - i * Wr >= 0) { ans = max(ans, i * Hr + (C - i * Wr) / Wb * Hb); } } cout << ans << endl; } return 0;}
- ZeptoLab Code Rush 2015 C. Om Nom and Candies
- ZeptoLab Code Rush 2015---C. Om Nom and Candies
- ZeptoLab Code Rush 2015 C题Om Nom and Candies
- C. Om Nom and Candies(ZeptoLab Code Rush 2015)
- ZeptoLab Code Rush 2015 B. Om Nom and Dark Park
- ZeptoLab Code Rush 2015 B. Om Nom and Dark Park
- ZeptoLab Code Rush 2015_B - Om Nom and Dark Park
- Codeforces ZeptoLab Code Rush 2015 B. Om Nom and Dark Park DFS
- 526C - Om Nom and Candies
- CF 526C Om Nom and Candies
- Codeforces 526C Om Nom and Candies
- Codeforces 526C - Om Nom and Candies
- CF Zepto Code Rush 2014 B. Om Nom and Spiders
- ZeptoLab Code Rush 2015
- CF Om Nom and Candies
- ZeptoLab Code Rush 2015 -- (A,B,C)
- Codeforces 526C - Om Nom and Candies (贪心 + 思维)
- codeforces 526 c Om Nom and Candies 剩余系
- FFmpeg命令行工具系列五---audio参数
- [LeetCode] Length of Last Word
- 实用的js
- 第二十题
- Google Protocol Buffer(1)—Overview
- ZeptoLab Code Rush 2015---C. Om Nom and Candies
- [Leetcode 74, medium] Search a 2D Matrix
- 关于java赋值的新手的一个小误区
- MINA 快速入门
- 第24课时,实践2,油量监控
- TowORthRee
- phpmyadmin,解决Deprecated: mysql_connect(): The mysql extension is deprecated and will be removed in t
- Unix网络编程(六)高级I/O技术之复用技术 select
- 动态规划之矩阵连乘