rt，具体可看这里。

WA on # 5，# 7，# 8，# 9 。

这是第五个测试点的数据。

码风优良，真心求调QAQ：

#include<bits/stdc++.h>
using namespace std;
const int MAX=210;

struct hp
{
	int num[MAX];
    hp & operator=(const char*);
    hp & operator=(int);
    hp();
    hp(int);
 
    bool operator > (const hp &) const;
    bool operator < (const hp &) const;
    bool operator <= (const hp &) const;
    bool operator >= (const hp &) const;
    bool operator != (const hp &) const;
    bool operator == (const hp &) const;
 
    hp operator + (const hp &) const;
    hp operator - (const hp &) const;
    hp operator * (const hp &) const;
    hp operator / (const hp &) const;
    hp operator % (const hp &) const;
 
    hp & operator += (const hp &);
    hp & operator -= (const hp &);
    hp & operator *= (const hp &);
    hp & operator /= (const hp &);
    hp & operator %= (const hp &);
};



hp & hp::operator = (const char* c)
{
	memset(num,0,sizeof(num));
	int n=strlen(c),j=1,k=1;
	for (int i=1;i<=n;i++)
	{
		if (k==10000) j++,k=1;
		num[j]+=k*(c[n-i]-'0');
		k*=10;
	}
	num[0]=j;
	return *this;
}
hp & hp::operator = (int a)
{
	char s[MAX];
	sprintf(s,"%d",a);
	return *this=s;
}
hp::hp() {memset(num,0,sizeof(num)); num[0]=1;}
hp::hp (int n) {*this = n;}



bool hp::operator > (const hp &b) const
{
	if (num[0]!=b.num[0]) return num[0]>b.num[0];
	for (int i=num[0];i>=1;i--)
		if (num[i]!=b.num[i])
			return (num[i]>b.num[i]);
	return false;
}
bool hp::operator < (const hp &b) const {return b>*this;}
bool hp::operator <= (const hp &b) const {return !(*this>b);}
bool hp::operator >= (const hp &b) const {return !(b>*this);}
bool hp::operator != (const hp &b) const {return (b>*this)||(*this>b);}
bool hp::operator == (const hp &b) const {return !(b>*this)&&!(*this>b);}



hp hp::operator + (const hp &b) const
{
	hp c;
	c.num[0] = max(num[0], b.num[0]);
	for (int i=1;i<=c.num[0];i++)
	{
		c.num[i]+=num[i]+b.num[i];
		if (c.num[i]>=10000)
		{
			c.num[i]-=10000;
			c.num[i+1]++;
		}
	}
	if (c.num[c.num[0]+1]>0) c.num[0]++;
	
	return c;
}
 
hp hp::operator - (const hp &b) const
{
	hp c;
	c.num[0] = num[0];
	for (int i=1;i<=c.num[0];i++)
	{
		c.num[i]+=num[i]-b.num[i];
		if (c.num[i]<0)
		{
			c.num[i]+=10000;
			c.num[i+1]--;
		}
	}
	while (c.num[c.num[0]]==0&&c.num[0]>1) c.num[0]--;
	
	return c;
}
 
hp & hp::operator += (const hp &b) {return *this=*this+b;}
hp & hp::operator -= (const hp &b) {return *this=*this-b;}

hp hp::operator * (const hp &b) const
{
	hp c;
	c.num[0] = num[0]+b.num[0]+1;
	for (int i=1;i<=num[0];i++)
	{
		for (int j=1;j<=b.num[0];j++)
		{
			c.num[i+j-1]+=num[i]*b.num[j];
			c.num[i+j]+=c.num[i+j-1]/10000;	
			c.num[i+j-1]%=10000;
		}
	}
	while (c.num[c.num[0]]==0&&c.num[0]>1) c.num[0]--;
	
	return c;
}
 
hp & hp::operator *= (const hp &b) {return *this=*this*b;}

hp hp::operator / (const hp& b) const
{
	hp c, d;
	c.num[0] = num[0]+b.num[0]+1;
	d.num[0] = 0;
	for (int i=num[0];i>=1;i--)
	{
		memmove(d.num+2, d.num+1, sizeof(d.num)-sizeof(int)*2);
		d.num[0]++;
		d.num[1]=num[i];
 
		int left=0, right=9999, mid;
		while (left < right)
		{
			mid = (left+right)>>1;
			if (b*hp(mid) <= d) left=mid+1;
			else right=mid;
		}
		c.num[i]=right-1;
		d=d-b*hp(right-1);
	}
	while (c.num[c.num[0]]==0&&c.num[0]>1) c.num[0]--;
 
	return c;
}
hp & hp::operator /= (const hp &b) {return *this=*this/b;}

hp hp::operator % (const hp& b) const
{
	hp c, d;
	c.num[0] = num[0]+b.num[0]+1;
	d.num[0] = 0;
	for (int i=num[0];i>=1;i--)
	{
		memmove(d.num+2, d.num+1, sizeof(d.num)-sizeof(int)*2);
		d.num[0]++;
		d.num[1]=num[i];
 
		int left=0,right=9999,mid;
		while (left < right)
		{
			mid = (left+right)/2;
			if (b*hp(mid) <= d) left=mid+1;
			else right=mid;
		}
		c.num[i]=right-1;
		d=d-b*hp(right-1);
	}
	while (c.num[c.num[0]]==0&&c.num[0]>1) c.num[0]--;
	return d;
}

ostream & operator<<(ostream & o, hp &n)
{
	o<<n.num[n.num[0]];
	for (int i=n.num[0]-1;i>=1;i--)
	{
		o.width(4);
		o.fill('0');
		o<<n.num[i];
	}
	return o;
}
 
istream & operator >> (istream & in, hp &n)
{
	char s[MAX];
	in>>s;
	n=s;
	return in;
}
const int N=1e4+10;
int n,B,A;
struct Node{int a,b;}a[N];
bool cmp(Node x,Node y){return x.a*x.b<=y.a*y.b;}

int main()
{
	cin>>n>>A>>B;
	for(int i=1;i<=n;++i)
	{
		cin>>a[i].a>>a[i].b;
	}
	stable_sort(a+1,a+n+1,cmp);
	hp AA=A,maxx=-1;
	for(int i=1;i<=n;++i)
	{
		if(maxx<AA/a[i].b)
		{
			maxx=AA/a[i].b;
		}
		AA*=a[i].a;
	}
	cout<<maxx;
	return 0;
}

墓前认为是高精除问题，但找不到错误。