杭电ACM1203(动态规划)

#include <iostream>
using namespace std;

#define MAXN 10002

double v[ MAXN ];

int main()
{
	int n, m;
	int a;
	double b;
	while(cin>>n>>m)
	{
		if(n == 0 && m ==0)
		{
			break;
		}
		for(int i = 0; i <= n; i ++)
		{
			v[ i ] = 1;
		}
		
		while(m > 0)
		{
			cin>>a>>b;
			b = 1 - b;
			for(int i = n; i >= a; i --)
			{
				v[ i ] = min(v[ i ], v[ i - a ] * b);	
			}
			m --;
		}
		printf("%.1lf%%\n",((1-v[ n ]) * 100));
	}
	return 0;
}