Hamburgers
2016-07-27 18:08
288 查看
O - Hamburgers
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his
favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe go from
bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.
Polycarpus has nb pieces of bread, ns pieces of sausage
and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles
for a piece of bread, ps for a piece of sausage and pc for
a piece of cheese.
Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage
or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.
Input
The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B),
'S' (uppercase English S) and 'C' (uppercase English C).
The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100)
— the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100)
— the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012)
— the number of rubles Polycarpus has.
Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.
Output
Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.
Sample Input
Input
Output
Input
Output
Input
Output
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his
favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe go from
bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again.
Polycarpus has nb pieces of bread, ns pieces of sausage
and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles
for a piece of bread, ps for a piece of sausage and pc for
a piece of cheese.
Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage
or cheese. Besides, the shop has an unlimited number of pieces of each ingredient.
Input
The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B),
'S' (uppercase English S) and 'C' (uppercase English C).
The second line contains three integers nb, ns, nc (1 ≤ nb, ns, nc ≤ 100)
— the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1 ≤ pb, ps, pc ≤ 100)
— the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1 ≤ r ≤ 1012)
— the number of rubles Polycarpus has.
Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.
Output
Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0.
Sample Input
Input
BBBSSC 6 4 1 1 2 3 4
Output
2
Input
BBC 1 10 1 1 10 1 21
Output
7
Input
BSC 1 1 1 1 1 3 1000000000000
Output
200000000001
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<queue> #include<stack> #include<math.h> #include<iostream> #include<algorithm> using namespace std; int main(){ char s[111]; __int64 psb = 0,pss = 0,psc = 0,cb,cs,cc,mb,ms,mc,money; gets(s); for(int i = 0; i < strlen(s); i++){ if(s[i]=='B') psb++; if(s[i]=='S') pss++; if(s[i]=='C') psc++; } scanf("%I64d%I64d%I64d",&cb,&cs,&cc); scanf("%I64d%I64d%I64d",&mb,&ms,&mc); scanf("%I64d",&money); __int64 l = 0,r = money + cb + cs + cc; while(r-1 > l){ __int64 mid = (l+r)>>1,mm = money; if(mid*psb > cb) mm -= (mid*psb-cb)*mb; if(mid*pss > cs) mm -= (mid*pss-cs)*ms; if(mid*psc > cc) mm -= (mid*psc-cc)*mc; if(mm >= 0) l = mid; else r = mid; } printf("%I64d\n",l); return 0; }
相关文章推荐
- 线程池ThreadPoolExecutor使用
- linux环境下给文件加密/解密的方法
- 第一份博客
- 数据结构HASH总结一:理论学习篇
- Github项目解析(十)-->几行代码快速集成二维码扫描库
- 结合AsyncTask 下载文件
- Red packet (二分)
- 朋友安利我的一本书“只有偏执狂才能成功”
- AngularJs1.X 项目文件结构
- OpenStack Mitaka 创建VM 报错:Cannot findsuitable emulator for x86_64
- WordCount运行详解
- spring 配置触发器
- 【poj3258】River Hopscotch
- 各类容器迭代器失效情况
- 找到100亿个URL中的重复URL以及搜索词汇的topK问题
- C# “试图访问已释放的资源”
- Sublime Text 3总是出现“1 missing dependency was just installed.”
- Request的getParameter和getAttribute方法的区别
- 324. Wiggle Sort II 摆动排序
- MA5889,奇岩MA5889,USB智能识别充电(双通道)解决方案