ACM--steps--1.3.1--FatMouse' Trade
2015-03-22 20:51
330 查看
FatMouse' Trade |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 5343 Accepted Submission(s): 1592 |
Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain. |
Input The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000. |
Output For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain. |
Sample Input5 3 7 2 4 3 5 2 20 3 25 18 24 15 15 10 -1 -1 |
Sample Output13.333 31.500 |
Author CHEN, Yue |
Source ZJCPC2004 |
Recommend JGShining |
相关文章推荐
- 杭电ACM 1009 FatMouse' Trade
- 杭电ACM 1009:FatMouse' Trade
- YT02-简单数学课后题-1001 FatMouse' Trade-(5.31日-烟台大学ACM预备队解题报告)
- 渣渣ACM日记——1009-FatMouse' Trade (HDOJ)
- ACM--猫鼠交易--HDOJ 1009--FatMouse' Trade--贪心
- ACM HDOJ FatMouse' Trade
- 杭电acm 1009 FatMouse' Trade 比较典型的贪心问题
- HDU1.3.1 FatMouse' Trade
- HDOJ---ACMSteps---1.3.1FatMouse' Trade
- 杭电 ACM 1009 FatMouse' Trade
- HDU 1.3.1 FatMouse' Trade
- ACM——FatMouse' Trade(贪心)
- 杭电 acm 1009 FatMouse' Trade
- ACM--猫鼠交易--贪心--HDOJ 1009--FatMouse' Trade
- 杭电 1009 FatMouse' Trade
- HDU 1009 FatMouse' Trade 贪心法
- FatMouse' Trade
- HDOJ 1009 FatMouse' Trade简单的贪心
- HDU——1009——FatMouse' Trade
- 15HD_OJ——FatMouse' Trade (贪心算法)