寒假翻译题训练 1月26号

链接：​​​​​​https://acs.jxnu.edu.cn/problem/HDU1009

题目：

描述：

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.

输入：

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.

输出：

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.

翻译如下

描述：

胖鼠准备了M磅的猫粮准备和作为仓管的猫交换他喜欢的食物——Java豆。仓库里面有N个房间，第i个房间里面有J[i]磅的Java豆，并且需要F[i]磅的猫粮用于交换。胖鼠没必要交换房间里所有的Java豆，相反，它可以用F[i]* a%磅的猫粮去交换J[i]* a%磅的Java豆。a为一个实数。现在它打算将这个任务交给你：告诉它它最多可以得到多少Java豆。

输入：

输入包含多组样例。每一组样例在第一行包括了两个非负整数M和N。接下来N行，每一行包括两个非负整数J[i]和F[i]。最后一组样例为两个-1.每一个整数均不大于1000.

输出：

对于每组样例，输出一个精确到小数点后三位的实数，表示胖鼠可以得到的Java豆的最大值