#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
double dp[
10005];
struct node
{
int money;
double pro;
}school[
10005];
int main()
{
int n,m;
while(
scanf(
"%d%d",&n,&m))
{
if(n==
0&&m==
0)
return 0;
int i,j;
double temp;
for(i=
1;i<=m;i++)
{
scanf(
"%d %lf",&school[i].money,&temp);
school[i].pro=
1.0-temp;
}
for(i=
0;i<=n;i++)
dp[i]=
1.0;
for(i=
1;i<=m;i++)
for(j=n;j>=school[i].money;j--)
dp[j]=min(dp[j],dp[j-school[i].money]*school[i].pro);
printf(
"%.1f%%\n",
100*(
1.0-dp[n]));
}
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-1299788.html