Description: 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.
To Search:
File list (Check if you may need any files):
Number Sequence.txt
Download