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 pounds of JavaBeans and requires F pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J* a% pounds of JavaBeans if he pays F* 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 and F 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 Input
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1
Sample Output
13.333
31.500
大神应该懂的
下面是我的代码
#include
struct stu
{
double a[2];
doubleb;
}stu[10000],t;
int main()
{
int i,j,n;
double m;
double bb=0;
while(scanf("%lf%d",&m,&n)&&(m!=-1||n!=-1))
{
for(i=0;i0&&i=0)
{
m-=stu.a[1] ;
bb+=stu.a[0] ;
//
printf("%lf\n",bb);
i++;
}
else
{
bb+=m*stu.b ;
m=0;
}
}
printf("%.3lf\n",bb);
}
return 0;
}
试了n次了 就是wrong answer;求助 啊
|
