vijosP1779国王游戏

题目：https://vijos.org/p/1779

题解：忽然想起来我好像还没写过高精度除以单精度，于是拿这题练练手。。。没想到1A了。。。

代码：

 #include<cstdio>
 #include<cstdlib>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 #include<iostream>
 #include<string>
 #include<set>
 #include<map>
 #include<vector>
 #include<queue>
 #define maxn (5000+10)
 #define for0(i,n) for(int i=0;i<=n;i++)
 #define for1(i,n) for(int i=1;i<=n;i++)
 #define for2(i,s,t) for(int i=s;i<=t;i++)
 #define for3(i,t,s) for(int i=t;i>=s;i--)
 #define ll long long
 #define mod 10000
 using namespace std;
 inline int read()
 {
   int x=,f=;char ch=getchar();
   while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
   while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}
   return x*f;
 }
 class bigg
 {
     public:
         int c[maxn],l;
         bigg(){memset(c,,sizeof(c));l=;}
         bigg operator = (int b)
         {
             memset(c,,sizeof(c));l=;
             while(b)c[++l]=b%mod,b/=mod;
             return(*this);
         }
         bigg operator =(const bigg &b)
         {
             l=b.l;
             for1(i,l)c[i]=b.c[i];
             return(*this);
         }
         bigg operator +(const bigg &b)
         {
             bigg a;
             a.l=max(l,b.l);
             for1(i,l)
              {
               a.c[i]+=a.l+b.l;
               a.c[i+]=a.c[i]/mod;
               a.c[i]%=mod;
              }
             if(c[a.l+])a.l++;
             return  a;
         }
         bigg operator *(int b)
         {
             bigg a;a.l=l;
             int x=;
             for1(i,l)
             {
                 x+=b*c[i];
                 a.c[i]=x%mod;
                 x/=mod;
             }
             while(x)a.c[++a.l]=x%mod,x/=mod;
             return a;
         }
         bigg operator /(int b)
         {
             bigg a;
             int x=;
             for3(i,l,)
             {
                 x=x*mod+c[i];
                 a.c[i]=x/b;
                 x%=b;
             }
             a.l=l;
             while(!a.c[a.l])a.l--;
             return a;
         }
         void print()
         {
             printf("%d",c[l]);
             for3(i,l-,)printf("%04d",c[i]);printf("\n");
         }
 };
 int n,a[maxn],b[maxn],c[maxn];
 inline bool cmp(int x,int y){return a[x]*b[x]<a[y]*b[y];}
 int main()
 {
     freopen("input.txt","r",stdin);
     freopen("output.txt","w",stdout);
     n=read()+;
     for1(i,n)a[i]=read(),b[i]=read(),c[i]=i;
     sort(c+,c+n+,cmp);
     bigg ans;ans=;
     for1(i,n-)ans=ans*a[c[i]];
     ans=ans/b[c[n]];
     ans.print();
     return ;
 }