荔园在线
荔园之美，在春之萌芽，在夏之绽放，在秋之收获，在冬之沉淀
[回到开始]
[上一篇][下一篇]
发信人: westship (" "), 信区: ACMICPC
标 题: 6:FatMouse' Trade
发信站: 荔园晨风BBS站 (Sat May 22 14:02:53 2004)
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 assignin
g 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 c
ontaining two non-negative integers M and N. Then N lines follow, each contain
s 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 deci
mal places, which is the maximum amount of JavaBeans that FatMouse can obtain.
Sample Input
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1
Sample Output
13.333
[回到开始]
[上一篇][下一篇]
荔园在线首页 友情链接：深圳大学 深大招生 荔园晨风BBS S-Term软件 网络书店