1203 HDU I NEED A OFFER! [01背包]

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{
	int n,m;
	int i,j;
	int a[10005];
	double dp[200005],b[10005];
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)
			break;
		for(i=1;i<=m;i++)
			scanf("%d %lf",&a[i],&b[i]);
		memset(dp,0,sizeof(dp));
		for(i=1;i<=m;i++)
			for(j=n;j>=a[i];j--)
				dp[j]=max(dp[j],1-(1-b[i])*(1-dp[j-a[i]]));
		printf("%.1lf",dp[n]*100);
		printf("%%\n");			
	}	
	return 0;
}